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

Photonic networks and Devices, networks 2018

作者： Alexoudi, Theoni Mitsolidou, Charoula Pitris, Stelios Han, Jong Hun Beldachi, Arash Farhadi Manihatty-Bojan, N. Ou, Y. Hugues-Salas, E. Broeke, R. Nejabati, R. Simeonidou, D. Pleros, Nikos Kanellos, George T. High Performance Networks group School of and Computer Science Electrical and Electronic Engineering and Engineering Maths University of Bristol BS8 1UB United Kingdom Department of Informatics Aristotle University of Thessaloniki Thessaloniki54124 Greece Information Technologies Institute Centre for Research and Technology Hellas Thessaloniki57001 Greece Bright Photonics B.V. Eindhoven5612 AX Netherlands

In the present communication we review recent advances in o-band silicon photonics transceivers and wavelength routers and demonstrate their potential application in board-level and rack level interconnection for edge... 详细信息

ISBN: (纸本)9781943580439

关键词： Silicon photonics

来源：评论

学校读者我要写书评

暂无评论

Inequality is rising where social network segregation interacts with urban topology

arXiv

引用

arXiv 2019年

作者： Tóth, Gergo Wachs, Johannes Di Clemente, Riccardo Jakobi, Ákos Ságvári, Bence Kertész, János Lengyel, Balázs Agglomeration and Social Networks Lendület Research Group Hungarian Academy of Sciences Hungary Spatial Dynamics Lab University College Dublin Ireland Computational Social Sciences and Humanities RWTH Aachen University Germany Centre for Advanced Spatial Analysis University College London United Kingdom Department of Computer Science University of Exeter United Kingdom Department of Regional Science Eötvös Loránd University Hungary Center for Social Sciences Hungarian Academy of Sciences Hungary Department of Network and Data Science Central European University Hungary International Business School Budapest Hungary

Social networks amplify inequalities due to fundamental mechanisms of social tie formation such as homophily and triadic closure. These forces sharpen social segregation reflected in network fragmentation. Yet, little is known about what structural factors facilitate fragmentation. In this paper we use big data from a widely-used online social network to demonstrate that there is a significant relationship between social network fragmentation and income inequality in cities and towns. We find that the organization of the physical urban space has a stronger relationship with fragmentation than unequal access to education, political segregation, or the presence of ethnic and religious minorities. Fragmentation of social networks is significantly higher in towns in which residential neighborhoods are divided by physical barriers such as rivers and railroads and are relatively distant from the center of town. Towns in which amenities are spatially concentrated are also typically more socially segregated. These relationships suggest how urban planning may be a useful point of intervention to mitigate inequalities in the long run. Copyright © 2019, The Authors. All rights reserved.

关键词： Urban planning

来源：评论

学校读者我要写书评

暂无评论

Decentralized base-graph routing for the quantum internet

引用

Physical Review A 2018年第2期98卷 022310-022310页

作者： Laszlo Gyongyosi Sandor Imre School of Electronics and Computer Science University of Southampton Southampton SO17 1BJ United Kingdom Department of Networked Systems and Services Budapest University of Technology and Economics Budapest H-1117 Hungary MTA-BME Information Systems Research Group Hungarian Academy of Sciences Budapest H-1051 Hungary

Quantum repeater networks are a fundamental of any future quantum internet and long-distance quantum communications. The entangled quantum nodes can communicate through several different levels of entanglement, leading to a heterogeneous, multilevel network structure. The level of entanglement between the quantum nodes determines the hop distance and the probability of the existence of an entangled link in the network. Here, we define a decentralized routing for entangled quantum networks. The proposed method allows an efficient routing to find the shortest paths in entangled quantum networks by using only local knowledge of the quantum nodes. We give bounds on the maximum value of the total number of entangled links of a path. The proposed scheme can be directly applied in practical quantum communications and quantum networking scenarios.

关键词： Quantum communication Quantum networks

来源：评论

学校读者我要写书评

暂无评论

Sensitivity and Asymptotic Analysis of Inter-Cell Interference Against Pricing for Multi-Antenna Base Stations

Sensitivity and Asymptotic Analysis of Inter-Cell Interferen...

引用

作者： Liu, Ye Lambotharan, Sangarapillai Derakhshani, Mahsa Nallanathan, Arumugam Wong, Kai-Kit Signal Processing and Networks Research Group Wolfson School Loughborough University LeicestershireLE11 3TU United Kingdom School of Electronic Engineering and Computer Science Queen Mary University of London LondonE1 4FZ United Kingdom Department of Electronic and Electrical Engineering University College London LondonWC1E 6BT United Kingdom

We thoroughly investigate the downlink beamforming problem of a two-tier network in a reversed time-division duplex system, where the interference leakage from a tier-2 base station (BS) toward nearby uplink tier-1 BSs is controlled through pricing. We show that soft interference control through the pricing mechanism does not undermine the ability to regulate interference leakage while giving flexibility to sharing the spectrum. Then, we analyze and demonstrate how the interference leakage is related to the variations of both the interference prices and the power budget. Moreover, we derive a closed-form expression for the interference leakage in an asymptotic case, where both the charging BSs and the charged BS are equipped with a large number of antennas, which provides further insights into the lowest possible interference leakage that can be achieved by the pricing mechanism. © 1972-2012 IEEE.

关键词： Beamforming

来源：评论

学校读者我要写书评

暂无评论

ABAC rule reduction via similarity computation 5th

ABAC rule reduction via similarity computation

引用

5th International Conference on Networked systems, NETYS 2017

作者： El Hadj, Maryem Ait Benkaouz, Yahya Freisleben, Bernd Erradi, Mohammed Networking and Distributed Systems Research Group TIES SIME Lab ENSIAS Mohammed V University in Rabat Rabat Morocco Conception and Systems Laboratory FSR Mohammed V University in Rabat Rabat Morocco Department of Mathematics and Computer Science Philipps-Universität Marburg Marburg Germany

ISBN: (纸本)9783319596464

Attribute-based access control (ABAC) represents a generic model of access control that provides a high level of flexibility and promotes information and security sharing. Since ABAC considers a large set of attributes for access decisions, using it might get very complicated for large systems. Hence, it is interesting to offer techniques to reduce the number of rules in ABAC policies without affecting the final decision. In this paper, we present an approach based on K-nearest neighbors algorithms for clustering ABAC policies. To the best of our knowledge, it is the first approach that aims to reduce the number of policy rules based on similarity computations. Our evaluation results demonstrate the efficiency of the suggested approach. For instance, the reduction rate can reach up to 10% for an ABAC policy with more than 9000 rules. © Springer International Publishing AG 2017.

关键词： Access control

来源：评论

学校读者我要写书评

暂无评论

Design-oriented structural controllability and observability analysis of Heat Exchanger networks

引用

Chemical Engineering Transactions 2018年 70卷 595-600页

作者： Leitold, Daniel Vathy-Fogarassy, Agnes Abonyi, Janos Department of Computer Science and Systems Technology University of Pannonia Egyetem Str. 10 VeszpremH-8200 Hungary MTA-PE Lendület Complex Systems Monitoring Research Group University of Pannonia Egyetem Str. 10. POB. 158 VeszpremH-8200 Hungary

The control-relevant design and analysis of Heat Exchanger networks (HENs) is an essential issue in terms of the design and intensification of sustainable production systems. The structural controllability and observability of HENs should be studied based on their dynamical model. Recently, a maximum matching based algorithm was developed to determine the locations of the minimum number of actuators and sensors needed to ensure the controllability and observability of linear dynamical systems. In this paper, the ability of concentrated parameter state-space models of the heat exchanger units to serve as building blocks of the network of state variables in HENs, and the use of the resultant network of state variables to study the control of relevant topologies and properties of HENs is highlighted. Based on the results of the systematic analysis, the structural patterns that facilitate the control and observation of HENs with a relatively small number of actuators and sensors were determined. Two methods were proposed to define the sets of additional actuators and sensors which are required to improve the operability of the network by decreasing the order of the controlled system. The first method is based on the interpretation of the placement of the sensors and actuators as a set cover problem, while the second one uses two network science-based measures: closeness centrality and betweenness centrality. The proposed methodologies are demonstrated on a benchmark example that is well covered in the literature. Copyright © 2018, AIDIC Servizi S.r.l.

关键词： Heat exchangers

来源：评论

学校读者我要写书评

暂无评论

Optimal pebbling number of the square grid

arXiv

引用

arXiv 2018年

作者： Gyori, Ervin Katonay, Gyula Y. Pappz, László F. Alfréd Rényi Institute of Mathematics Budapest Hungary Department of Mathematics Central European University Budapest Hungary Department of Computer Science and Information Theory Budapest University of Technology and Economics Hungary MTA-ELTE Numerical Analysis and Large Networks Research Group Hungary

A pebbling move on a graph removes two pebbles from a vertex and adds one pebble to an adjacent vertex. A vertex is reachable from a pebble distribution if it is possible to move a pebble to that vertex using pebbling moves. The optimal pebbling number opt is the smallest number m needed to guarantee a pebble distribution of m pebbles from which any vertex is reachable. The optimal pebbling number of the square grid graph Pn Pm was investigated in several papers [1, 12, 9]. In this paper, we present a new method using some recent ideas to give a lower bound on opt. We apply this technique to prove that opt(PnPm) 2 13nm. Our method also gives a new proof for opt(Pn) = opt(Cn) =-2n 3 . Copyright © 2018, The Authors. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Overlapping Coalition Formation Game Based Opportunistic Cooperative Localization Scheme for Wireless networks

Overlapping Coalition Formation Game Based Opportunistic Coo...

引用

作者： Zhang, Rongqing Zhao, Zijun Cheng, Xiang Yang, Liuqing State Key Laboratory of Advanced Optical Communication Systems and Networks School of Electronics Engineering and Computer Science Peking University Beijing100080 China Department of Electrical and Computer Engineering Colorado State University Fort CollinsCO80523 United States Research Center for Development Strategy China Electronics Technology Group Corporation Beijing100041 China

Cooperative localization has emerged as a promising technique which can complement or even replace global positioning systems (GPS) in many practical scenarios, such as GPS-denied environments. In this paper, we concentrate on the distributed cooperative localization design. The conventional distributed cooperative localization approaches usually yield high computational complexity and communication overhead, due to the lack of an efficient link selection mechanism. For this purpose, we propose a novel concept named opportunistic cooperative localization, based on which each agent is able to select the most informative links rather than utilize all the possible links in a distributed, self-organized, and self-optimized manner. To achieve effective opportunistic selection, overlapping coalition formation (OCF) game is employed. In addition, we also provide an optimized terminating criterion, based on which the agents will be able to know whether and when they are well localized, and thus can terminate their localization procedure efficiently. Through simulations, we observe that by virtue of the proposed OCF game based opportunistic cooperative localization scheme along with the provided terminating criterion, the limitations of conventional distributed cooperative localization can be alleviated at the cost of negligible performance degradation. © 1972-2012 IEEE.

关键词： Global positioning system

来源：评论

学校读者我要写书评

暂无评论

Growing scale-free simplices

arXiv

引用

arXiv 2020年

作者： Kovalenko, K. Sendiña-Nadal, I. Khalil, N. Dainiak, A. Musatov, D. Raigorodskii, A.M. Alfaro-Bittner, K. Barzel, B. Boccaletti, S. Moscow Institute of Physics and Technology National Research University 9 Institutskiy per. Dolgoprudny Moscow Region141701 Russia Complex Systems Group GISC Universidad Rey Juan Carlos Móstoles Madrid28933 Spain Center for Biomedical Technology Universidad Politécnica de Madrid Pozuelo de Alarcón Madrid28223 Spain ESCET GISC Universidad Rey Juan Carlos Móstoles Madrid28933 Spain Moscow Institute of Physics and Technology National Research University 9 Institutskiy per. Dolgoprudny Moscow Region141701 Russia Russian Academy of National Economy and Public Administration pr. Vernadskogo 84 Moscow119606 Russia Caucasus Mathematical Center Adyghe State University ul. Pervomaiskaya 208 Maykop Russia Mechanics and Mathematics Faculty Moscow State University Moscow Russia Institute of Mathematics and Computer Science Buryat State University Ulan-Ude Russia Unmanned Systems Research Institute Northwestern Polytechnical University Xi'an710072 China Departamento de Física Universidad Técnica Federico Santa María Av. España 1680 Casilla 110V Valparaíso Chile Department of Mathematics Bar-Ilan University Ramat-Gan5290002 Israel Gonda Multidisciplinary Brain Research Center Bar-Ilan University Ramat-Gan5290002 Israel CNR - Institute of Complex Systems Via Madonna del Piano 10 Sesto FiorentinoI-50019 Italy

The past two decades have seen significant successes in our understanding of complex networked systems, from the mapping of real-world social, biological and technological networks to the establishment of generative models recovering their observed macroscopic patterns. These advances, however, are restricted to pairwise interactions, captured by dyadic links, and provide limited insight into higher-order structure, in which a group of several components represents the basic interaction unit. Such multi-component interactions can only be grasped through simplicial complexes, which have recently found applications in social and biological contexts, as well as in engineering and brain science. What, then, are the generative models recovering the patterns observed in real-world simplicial complexes? Here we introduce, study, and characterize a model to grow simplicial complexes of order two, i.e. nodes, links and triangles, that yields a highly flexible range of empirically relevant simplicial network ensembles. Specifically, through a combination of preferential and/or non preferential attachment mechanisms, the model constructs networks with a scale-free degree distribution and an either bounded or scale-free generalized degree distribution the latter accounting for the number of triads surrounding each link. Allowing to analytically control the scaling exponents we arrive at a highly general scheme by which to construct ensembles of synthetic complexes displaying desired statistical properties. Copyright © 2020, The Authors. All rights reserved.

关键词： Complex networks

来源：评论

学校读者我要写书评

暂无评论

Proactive Access Point Driven Handovers in IEEE 802.11 networks

Proactive Access Point Driven Handovers in IEEE 802.11 Netwo...

引用

International Conference on Network and Service Management

作者： Ensar Zeljković Johann M. Marquez-Barja Andreas Kassler Roberto Riggio Steven Latré University of Antwerp - imec IDLab research group Middelheimlaan 1 Antwerp Belgium Computer Science Department Universitetsgatan 2 Karlstad University Karlstad Sweden FBK CREATE-NET Wireless and Networked Systems Via Alla Cascata 56 Trento Italy

ISBN: (纸本)9781538691939;9783903176140

In large and densely deployed IEEE 802.11 networks, a fast and seamless handover scheme is an important aspect in order to provide reliable connectivity for mobile users. However, IEEE 802.11 only supports decentralized, reactive and mobile node-driven handovers resulting in long handover times, packet loss due to interrupted connectivity and sub-optimal access point selection. Recently, centralized approaches have been developed that try to solve many of the challenges but these are mostly proprietary, reactive and require changes to mobile node stacks. In this paper, we propose a novel handover solution based on the principle of Software Defined Networking, that addresses the aforementioned challenges. Using virtualization and softwarization, we shift the traditional mobile node-driven handovers to the access point, while maintaining compliance with legacy devices. Moreover, we develop a proactive handover algorithm ADNA, which combines network state, traffic load and node mobility information. We evaluate our approach extensively in a testbed, showing that it outperforms existing approaches by improving the overall throughput by 116% while reducing the number of handovers by 44% on average.

关键词： Handover IEEE 802.11 Standard Measurement Throughput Quality of service

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：