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

您好，读者！请登录

内蒙古大学图书馆

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

咨询与建议

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

您的常用邮箱：*

您的手机号码：*

问题描述：

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

分类表

所选分类

>> <<

限定检索结果

文献类型

67 篇 会议
1 册 图书

馆藏范围

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

日期分布

学科分类号

30 篇 工学
- 29 篇 计算机科学与技术...
- 10 篇 信息与通信工程
- 9 篇 电气工程
- 5 篇 软件工程
- 2 篇 控制科学与工程
- 1 篇 力学（可授工学、理...
- 1 篇 石油与天然气工程
- 1 篇 网络空间安全
25 篇 管理学
- 25 篇 管理科学与工程(可...
- 4 篇 工商管理
17 篇 理学
- 15 篇 数学
- 5 篇 统计学（可授理学、...
- 2 篇 物理学
- 1 篇 系统科学
2 篇 经济学
- 2 篇 应用经济学

主题

11 篇 games
10 篇 optimization
8 篇 nash equilibrium
6 篇 convergence
5 篇 routing
4 篇 vectors
4 篇 cost function
4 篇 heuristic algori...
3 篇 network topology
3 篇 bandwidth
3 篇 resource managem...
3 篇 social network s...
3 篇 game theory
3 篇 mobile communica...
3 篇 delay
2 篇 delays
2 篇 markov processes
2 篇 handover
2 篇 network routing
2 篇 ieee 802.11 stan...

机构

2 篇 university of av...
2 篇 dipartimento di ...
2 篇 balvatnik school...
2 篇 department of el...
2 篇 departamento de ...
2 篇 edward s. rogers...
2 篇 laboratorio di m...
1 篇 beijing univ pos...
1 篇 lia univesite d'...
1 篇 cy univ etis umr...
1 篇 institute of con...
1 篇 tech univ cluj n...
1 篇 dept. of electri...
1 篇 national institu...
1 篇 supelec e3s f-91...
1 篇 university of ed...
1 篇 lehrstuhl ii für...
1 篇 avignon univ lia...
1 篇 graduate school ...
1 篇 department of el...

作者

3 篇 hayel yezekael
2 篇 lasaulce samson
2 篇 mertikopoulos pa...
2 篇 echabbi loubna
2 篇 ariel orda
2 篇 altman eitan
2 篇 nino-mora jose
2 篇 moshe haviv
2 篇 beaude olivier
2 篇 kameda hisao
1 篇 igal milchtaich
1 篇 andrés arcia-mor...
1 篇 george athanasio...
1 篇 lejosne yohan
1 篇 montavont nicola...
1 篇 jason r. marden
1 篇 quadri dominique
1 篇 yohan lejosne
1 篇 hamlaoui chahine...
1 篇 zhang zhicai

语言

68 篇 英文

检索条件"任意字段=International Conference on NETwork Games, Control and Optimization, NetGCooP 2011"

共 68 条记录，以下是21-30 订阅

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

详细简洁

排序：

A time and space routing game model applied to visibility competition on online social networks

A time and space routing game model applied to visibility co...

引用

international conference on network games, control and optimization (netgcoop)

作者： Alexandre Reiffers Masson Eitan Altman Yezekael Hayel Maestro project INRIA Sophia-Antipolis Sophia-Antipolis Cedex France University of Avignon France

ISBN: (纸本)9781509039586

Companies or users that want to do advertising on Online Social networks, need to know in which News Feed it would be more efficient to post, at what time of day the posts would have more visibility and which topic of message they should choose to reach popularity. We propose to answer these questions with the help of the Routing Game Theory, which considers a finite number of players and splittable demands. First, we propose a visibility measure on a News Feed. Next, we present our game based on visibility measures, which is similar to the Weighted Allocation Game. Following this consideration, we provide the uniqueness of the Nash Equilibrium, a characterization via concave programming, and its closed form. Then, we propose a two time scale decentralized algorithm where each user estimates the total flow of messages in each News Feed and uses stochastic gradient algorithm to update their own flows. Finally, we use a real data set in order to estimate the parameters of our model. The goal of this model is to provide to the Online Social network Authority a better knowledge of posting behavior of competitive users.

关键词： Feeds games Social network services Routing Nash equilibrium Resource management

来源：评论

学校读者我要写书评

暂无评论

Multi-dimensional network security game: How do attacker and defender battle on parallel targets?

Multi-dimensional network security game: How do attacker and...

引用

international conference on network games, control and optimization (netgcoop)

作者： Yuedong Xu John C.S. Lui Department of Electronic Engineering Fudan University China Department of Computer Science & Engineering The Chinese University of Hong Kong China

ISBN: (纸本)9781509039586

In this paper, we consider a new network security game wherein an attacker and a defender are battling over “multiple” targets. This type of game is appropriate to model many current network security conflicts such as Internet phishing, mobile malware or network intrusions. In such attacks, the attacker and the defender need to decide how to allocate resources on each target so as to maximize their utilities within their resource limits. We model such a multidimensional network security game as a constrained nonzero sum game. Two security breaching models, the product-form and the proportion-form, are considered. For each breaching model, we prove the existence of a unique Nash equilibrium (NE) based on Rosen's theorem and propose efficient algorithms to find the NE when the games are strictly concave. Furthermore, we show the existence of multiple NEs in the product-form breaching model when the strict concavity does not hold. Our study sheds light on the strategic behaviors of the attacker and the defender, in particular, on how they allocate resources to the targets which have different weights, and how their utilities as well as strategies are influenced by the resource constraints.

关键词： Security games Communication networks Malware Mobile communication Mobile computing Internet

来源：评论

学校读者我要写书评

暂无评论

Equilibrium and socially optimal arrivals to a single server loss system

Equilibrium and socially optimal arrivals to a single server...

引用

international conference on network games, control and optimization (netgcoop)

作者： Liron Ravner Moshe Haviv Department of Statistics and the Center for the Study of Rationality Hebrew University of Jerusalem

ISBN: (纸本)9781509039586

We study a single server model with no queue and exponential services times, in which service is only provided during a certain time interval. A number of customers wish to obtain this service and can choose their arrival time. A customer that finds a busy server leaves without being served. We model this scenario as a non-cooperative game in which the customers wish to maximize their probability of obtaining service. We characterize the Nash equilibrium and the price of anarchy, which is defined as the ratio between the optimal and equilibrium social utility. In particular, the equilibrium arrival distribution has an atom at zero, a period with no arrival and is continuous on some interval until the closing time. We further generalize our analysis to take into account uncertainty regarding the population size, i.e. a game with a random number of customers. In the special case where the population size follows a Poisson distribution, we show that the continuous part of the distribution is uniform, which is not the case in general. Finally, we show that the price of anarchy is not monotone with respect to the population size; but rather uni-modal with values close to one for small and large populations.

关键词： Servers games Sociology Statistics Analytical models Nash equilibrium optimization

来源：评论

学校读者我要写书评

暂无评论

Dynamic algorithms for cooperation in user-provided network services

Dynamic algorithms for cooperation in user-provided network ...

引用

international conference on network games, control and optimization (netgcoop)

作者： Leonidas Georgiadis George Iosifidis Leandros Tassiulas Dept. of Electrical and Computer Engineering Aristotle University of Thessaloniki and CERTH Greece Dept. of Electrical and Computer Engineering University of Thessaly and CERTH Greece

ISBN: (纸本)9781509039586

The ever increasing demand for Internet access, and the proliferation of advanced user-owned network equipment have given rise to collaborative schemes, where users satisfy each other's communication needs whenever they have spare network resources. In this paper, we consider such an autonomous model where users have random resource availability and decide independently how to serve each other. For this dynamic setting, we find that a myopic proportional allocation strategy, applied by each node in an asynchronous fashion based only on local information, converges to a stable equilibrium point. Moreover, we show through numerical examples, that the equilibrium exhibits a rich structure and coincides with the lexicographically maximum allocation of the users' resources. Accordingly, we consider a more sophisticated model where each user can pay for the services she receives, with service credits. This enhances the cooperation beyond those users that can directly exchange resources. For this setting, we propose a backpressure-inspired heuristic algorithm for implementing a lightweight, decentralized service exchange scheme, based on the credit backlogs, that balances as much as possible the service allocation across the different users.

关键词： Resource management Dynamic scheduling Numerical models Heuristic algorithms Internet Collaboration Nickel

来源：评论

学校读者我要写书评

暂无评论

Energy-Efficient Resource optimization in Spectrum Sharing Two-Tier Femtocell networks

Energy-Efficient Resource Optimization in Spectrum Sharing T...

引用

IEEE international conference on Communications (ICC)

作者： Zhang, Zhicai Zhang, Haijun Liu, Hui Jing, Wenpeng Wen, Xiangming Beijing Univ Posts & Telecommun Sch Informat & Commun Engn Beijing Key Lab Network Syst Architecture & Conve Beijing Peoples R China

ISBN: (纸本)9781467357531

Due to the limited battery resources of mobile clients, uplink energy-efficient communication is becoming increasingly important. In this paper, we propose a convex pricingbased resource allocation algorithm to improve the energyefficiency of two-tier co-channel femtocell networks. We model the subchannel allocation and power control problem as a non-cooperative game, where both the transmit power and circuit power are considered. To reduce the complexity while maintaining good performance, we decompose the power control and subchannel allocation problem into two sub-problems. A suboptimal subchannel allocation algorithm and a optimal power control algorithm are proposed to resolve the non-cooperative games. Numerical results show the proposed resource allocation schemes are effective in increasing energy-efficient performance while keeping low complexity.

关键词： channel allocation femtocellular radio power control telecommunication control

来源：评论

学校读者我要写书评

暂无评论

Characterizing Spontaneous IEEE 802.11 network Deployments

Characterizing Spontaneous IEEE 802.11 Network Deployments

引用

6th international conference on network games, control and optimization (netgcoop)

作者： Arcia-Moret, Andres Molina, Laudin Castignani, German Montavont, Nicolas Univ Europeene Bretagne Inst Telecom Telecom Bretagne Bretagne France Univ Los Andes Merida Venezuela

ISBN: (纸本)9781467360265

Nowadays, 802.11 networks have been deployed in a scale similar to that of Ethernet networks in the 90' s. Devices willing to connect to a single access point should discover it before attempting a connection. The discovery process has been proved to be highest delay sub-process during the initial discovery or a handover for seamless connectivity. In this article we present a detailed description of the scanning process in a Linux kernel, and analyze metrics of two different scenarios to characterize spontaneous deployments.

关键词： IEEE 802.11 spontaneous deployment discovery time

来源：评论

学校读者我要写书评

暂无评论

network-Constrained Adaptive control with a Nonlinear Tracking Function

Network-Constrained Adaptive Control with a Nonlinear Tracki...

引用

6th international conference on network games, control and optimization (netgcoop)

作者： Sharon, Yoav Annaswamy, Anuradha M. Motto, Alexis L. MIT Dept Mech Engn Cambridge MA 02139 USA Siemens Corp Corp Res Princeton NJ 08540 USA

ISBN: (纸本)9781467360265

We consider a problem where several agents need to achieve a common control objective. The motivation for this problem is control of power generation in a wind farm under weak-grid conditions, with the individual turbine-generators acting as agents. The control objective is a nonlinear function of the state of the agents. Furthermore, this nonlinear function depends on the parameters of the network connecting the agents, and these parameters are unknown. Based on a newly developed nonlinear adaptive control methodology, a process is designed that simultaneously learns the network parameters and, using individual controllers, drives the agents to their respective steady-state solutions. We also compare the performance of this design to an empirical control design that requires less communication.

关键词： network parameters Agents nonlinear functions Wind farms adaptive control Nonlinear adaptive control network connection Power control common control

来源：评论

学校读者我要写书评

暂无评论

Index-based Dynamic Energy Management In a Multimode Sensor network

Index-based Dynamic Energy Management In a Multimode Sensor ...

引用

6th international conference on network games, control and optimization (netgcoop)

作者： Nino-Mora, Jose Univ Carlos III Madrid Dept Stat Leganes 28911 Madrid Spain

ISBN: (纸本)9781467360265

This paper considers a model for the optimal dynamic energy management in a wireless sensor network (WSN) with M homogeneous sensors tracking N >= M heterogeneous targets. The WSN feeds on a limited, shared energy pool provided by an energy-harvesting station. Sensors can be operated in multiple modes, subject to a peak global energy consumption constraint. An approach is developed to construct a tractable heuristic scheduling policy based on marginal productivity indices (MPIs) defined separately for each target. Sufficient conditions are given which ensure both the existence of such an index and point towards an approach for its evaluation

关键词： Energy management Wireless sensor networks Sensor networks Sufficient conditions WSN gene energy consumption Heuristic scheduling energy harvesting Sensors

来源：评论

学校读者我要写书评

暂无评论

Crowd-Measuring: assessing the Quality of mobile Internet from end-terminals

Crowd-Measuring: assessing the Quality of mobile Internet fr...

引用

6th international conference on network games, control and optimization (netgcoop)

作者： Hourton, Gabriel Del Canto, Gabriel Bustos, Javier Lalanne, Felipe NIC Chile Res Labs Santiago Chile Telecom SudParis Evry France

ISBN: (纸本)9781467360265

Allowing mobile Internet customers to evaluate the quality of the service they are being provided empowers them as consumers, hence driving competition. However little research has been done in this issue. On this context, we introduce early work on our monitoring solution which integrates the data collected through the use of a passive monitoring tool that can be installed on Android terminals with the data collected through web proxies and end servers. Our contribution is two-fold: we provide a new technique for passive monitoring of 2G/3G QoS, as well as a tool that can be installed by mobile phone users in order to monitor their service statistics. Once results are obtained, we expect to have enough data to provide a characterization of the mobile Internet landscape in Chile.

关键词： mobile devices network monitoring 3G networks

来源：评论

学校读者我要写书评

暂无评论

PageRank optimization applied to spam detection

PageRank optimization applied to spam detection

引用

6th international conference on network games, control and optimization (netgcoop)

作者： Fercoq, Olivier Univ Edinburgh Edinburgh EH8 9YL Midlothian Scotland

ISBN: (纸本)9781467360265

We give a new link spam detection and PageRank demotion algorithm called MaxRank. Like TrustRank and AntiTrustRank, it starts with a seed of hand-picked trusted and spam pages. We define the MaxRank of a page as the frequency of visit of this page by a random surfer minimizing an average cost per time unit. On a given page, the random surfer selects a set of hyperlinks and clicks with uniform probability on any of these hyperlinks. The cost function penalizes spam pages and hyperlink removals. The goal is to determine a hyperlink deletion policy that minimizes this score. The MaxRank is interpreted as a modified PageRank vector, used to sort web pages instead of the usual PageRank vector. We show that the bias vector of the associated ergodic control problem, which is unique up to an additive constant, is a measure of the "spamicity" of each page, used to detect spam pages. We give a scalable algorithm for MaxRank computation that allowed us to perform numerical experiments on the WEBSPAM-UK2007 dataset. We show that our algorithm outperforms both TrustRank and AntiTrustRank for spam and nonspam page detection.

关键词： Unsolicited electronic mail Hyperlinks additive constant Unit of time

来源：评论

学校读者我要写书评

暂无评论

没有更多数据了...

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

共7页 << < 1 2 3 4 5 6 7 > >>

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

隐藏清空

合并搜索

回到顶部

执行限定条件

内容：

评分：

请选择保存的检索档案：

请选择收藏分类：

订阅名称：

通借通还

温馨提示：

图书名称：

借书校区：

取书校区：

手机号码：

邮箱地址：

一卡通帐号：

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

联系人：

所在院系：

联系邮箱：

联系电话：

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

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：