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

18th International Conference on the Design of Reliable Communication Networks (DRCN)

作者： Santos, Dorabella Gomes, Teresa Martins, Lucia Vidal, Joao P. INESC Coimbra DEEC Rua Silvio LimaPolo 2 P-3030290 Coimbra Portugal Univ Coimbra Dept Elect & Comp Engn INESC Coimbra Rua Silvio LimaPolo 2 P-3030290 Coimbra Portugal

ISBN: (纸本)9781665409872

In Software-Defined Networking (SDN), the data plane is defined by the switches which are connected to a set of controllers defining the control plane. The intercontroller connections have lacked the same focus in the literature as the switch-controller connections, despite the set of logically centralized controllers being the brain of the SDN network. In this paper, we address a bi-objective joint optimization problem involving the controller placement problem, geodiversity and intercontroller availability guarantees. The availability guarantees imply a subgraph whose links can be upgraded at a given cost. The geodiversity constraints extend robustness to disaster-based failures. To solve this NP-complete non-linear problem, we employ a heuristic strategy based on the decomposition into manageable subproblems.

关键词： SDN controller placement availability heuristics integer linear programming bi-objective

来源：评论

学校读者我要写书评

暂无评论

B-Scale: Bottleneck-aware VNF Scaling and Flow Routing in Edge Clouds 27

B-Scale: Bottleneck-aware VNF Scaling and Flow Routing in Ed...

引用

IEEE Symposium on Computers and Communications (ISCC)

作者： Chen, Chen Nagel, Lars Cui, Lin Tso, Fung Po Loughborough Univ Dept Comp Sci Loughborough Leics England Jinan Univ Dept Comp Sci Guangzhou Peoples R China

ISBN: (数字)9781665497923

ISBN: (纸本)9781665497923

With the ever-growing demand for low-latency network applications, edge computing emerges as a new paradigm that provides computation and storage resources in close proximity to end-users. Many research efforts have resorted to network function virtualization, wherein network applications are provisioned as service function chains at edge clouds. However, due to the traffic dynamics and limited resource capacity at the network edge, how to efficiently embed service chains with latency optimization and resource efficiency remains as a challenging problem. As most existing research efforts largely overlook the bottle-necked resources of VNFs in the VNF scaling, we seek a more realistic approach to provisioning VNF instances across multiple edge clouds. Also, given the limited resources at the edge, it is of significant importance to improve the VNF utilization rate. Specifically, we formulate the VNF scaling problem as an integer linear programming (ILP) problem, aiming to minimize the end-to-end latency for service function chains. To solve this problem, we devise a novel bottleneck-aware algorithm that manages the number and deployment of newly created instances. After that, we propose an online algorithm for traffic steering to improve the utilization rates of VNF instances and avoid congestion on hotspot links. The proposed algorithm is shown to provide good performance by trace-driven simulation in real-world topologies.

关键词： Cloud computing Service function chaining integer linear programming Routing Topology Network function virtualization Resource management

来源：评论

学校读者我要写书评

暂无评论

Anchored Constrained Clustering Ensemble

Anchored Constrained Clustering Ensemble

引用

IEEE International Conference on Fuzzy Systems (FUZZ-IEEE) / IEEE World Congress on Computational Intelligence (IEEE WCCI) / International Joint Conference on Neural Networks (IJCNN) / IEEE Congress on Evolutionary Computation (IEEE CEC)

作者： Guilbert, Mathieu Vrain, Christel Thi-Bich-Hanh Dao de Souto, Marcilio C. P. Univ Orleans INSA Ctr Val Loire LIFO EA 4022 Orleans France

ISBN: (数字)9781728186719

ISBN: (纸本)9781728186719

In the context of semi-supervised learning and clustering ensemble methods, we introduce a novel strategy to consider not only pairwise constraints, but also triplet constraints. As far as we are aware, the latter have not been addressed in the literature of semi-supervised clustering ensembles. The strategy consists of a post-processing applied once a consensus partition has been built. Taking into account the fact that the clusters of the consensus partition are usually not spherical, in order to maintain their complex shapes, we first generate anchors, which are data points judged representative of the clusters, in such a way that every point in the cluster has an anchor close to it. These anchors are then used to create a data structure that we call an allocation matrix, which measures the assignment score of each point to each cluster in the consensus partition. Such a matrix is provided to an integer linear Programing (ILP) model to find the partition which is closest to the consensus partition, while satisfying the constraints. The experimental results show that our method, given an initial consensus partition and a set of constraints, allows to satisfy all the given constraints, modifying the initial partition, but without deteriorating considerably its quality.

关键词： clustering clustering ensemble integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Jingwei: An Efficient and Adaptable Data Migration Strategy for Deduplicated Storage Systems 41

Jingwei: An Efficient and Adaptable Data Migration Strategy ...

引用

41st IEEE Conference on Computer Communications (IEEE INFOCOM)

作者： Cheng, Geyao Guo, Deke Luo, Lailong Xia, Junxu Sun, Yuchen Natl Univ Def Technol Sci & Technol Informat Syst Engn Lab Changsha Hunan Peoples R China Natl Univ Def Technol Natl Lab Parallel & Distributed Proc Changsha Hunan Peoples R China

ISBN: (纸本)9781665458221

The traditional migration methods are confronted with formidable challenges when data deduplication technologies are incorporated. Firstly, the deduplication creates data-sharing dependencies in the stored files;breaking such dependencies in migration would attach extra space overhead. Secondly, the redundancy elimination heightens the risk of data unavailability during server crashes. The existing methods fail to tackle them at one shot. To this end, we propose Jingwei, an efficient and adaptable data migration strategy for deduplicated storage systems. To be specific, Jingwei tries to minimize the extra space cost in migration for space efficiency. Meanwhile, Jingwei realizes the service adaptability by encouraging replicas of hot data to spread out their data access requirements. We first model such a problem as an integer linear programming (ILP) and solve it with a commercial solver when only one empty migration target server is allowed. We then extend this problem to a scenario wherein multiple non-empty target servers are available for migration. We solve it by effective heuristic algorithms based on the Bloom Filter-based data sketches. Trace-driven experiments show that Jingwei fortifies the file replicas by 25%, while only 5.7% of the extra storage space is occupied compared with the latest "Goseed" method.

关键词： Adaptation models Costs Heuristic algorithms Conferences Redundancy integer linear programming Filtering algorithms

来源：评论

学校读者我要写书评

暂无评论

Electric vehicle car-sharing optimization relocation model combining user relocation and staff relocation

引用

TRANSPORTATION LETTERS-THE INTERNATIONAL JOURNAL OF TRANSPORTATION RESEARCH 2021年第4期13卷 315-326页

作者： Wang, Ning Guo, Jiahui Liu, Xiang Liang, Yiyu Tongji Univ Sch Automot Studies Shanghai 201804 Peoples R China Tongji Univ Coll Transportat Engn Shanghai Peoples R China

Factors including unbalanced user travel demand, vehicle charging status, and high operating cost of enterprises have restricted the development of electric vehicle car-sharing. This paper comprehensively considers the impact of multiple dynamic constraints such as user demand, state of charge of electric vehicles, and operating profit on vehicle relocation. The travel behavior of consumers is studied through Multinomial Logistic Regression method. User demand for electric vehicle car-sharing is forecast through Hidden Markov Model. A new vehicle relocation strategy combining staff relocation and user relocation is formulated. With the goal of maximizing enterprise profit, an electric vehicle car-sharing optimization relocation model in region level is finally established. Taking Anting Town as an example to verify the model, the results show that this new vehicle relocation strategy can effectively reduce the operating cost of enterprises, improve the circulation rate and utilization rate of vehicles, and reduce unnecessary waste of resources.

关键词： Electric vehicle car-sharing relocation optimization staff relocation user relocation integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Multidimensional Assignment Problem in the medical sector: A case study 10th

Multidimensional Assignment Problem in the medical sector: A...

引用

10th IFAC Triennial Conference on Manufacturing Modelling, Management and Control (MIM)

作者： Tran, Quoc Nhat Han Nguyen, Nhan Quy Amodeo, Lionel Yalaoui, Farouk Chehade, Hicham Opta LP SAS 2 Rue Gustave Eiffel F-10430 Rosieres Pres Troyes France Univ Technol Troyes Comp Sci & Digital Soc Lab LIST3N 12 Rue Marie CurieCS 42060 F-10004 Troyes France Univ Technol Troyes Chaire Connected Innovat 12 Rue Marie Curie F-10004 Troyes France

This paper studies a Multidimensional Assignment Problem (MAP) applied in the medical sector. The case study is taken from a major french medical service provider. This problem consists of assigning medical employees to perform healthcare or administrative tasks at workplaces within a predefined scheduling horizon. The system of constraints, such as ability, compatibility, availability, and accommodation capacity, characterizes the complexity of this study. The objective is to minimize the gap between the assigned workload and the target contractual workload. As far as we know, the Mixed-integer linear programming (MILP) presented in this paper is the first model to handle such an objective. Numerical experiments are conducted on real-world instances to compare the performance of several well-known open-source and commercial solvers. The results serve as preliminary evidence for a feasibility study and allow us to select an appropriate approach for an efficient aid-decision system. Copyright (C) 2022 The Authors.

关键词： eHealth Urban Healthcare integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Priority-aware Static Task Mapping for Edge-Cloud Platforms

Priority-aware Static Task Mapping for Edge-Cloud Platforms

引用

International Conference on Electronics, Information, and Communication (ICEIC)

作者： Yoshimoto, Jo Taniguchi, Ittetsu Tomiyama, Hiroyuki Onoye, Takao Osaka Univ Suita Osaka Japan Ritsumeikan Univ Kyoto Japan

ISBN: (纸本)9781665409346

IoT (Internet-of-Things) technologies enable various applications, and these applications take an important role in our society. On the IoT systems, various tasks with priorities are mapped on the edge or the cloud, and these tasks are iteratively executed on them as communicating with each other. To realize such collaborative execution on edge-cloud platforms, effective task mapping is important to consider the task priority and deadline under various situations. Additionally, if the important tasks cannot be executed by keeping the deadline under the given situation, the limited resources should be assigned to the mandatory tasks to minimize the damage. In this paper, we propose the priority-aware static task mapping method for edge-cloud platforms. The proposed method finds the optimal task mapping to minimize the deadline miss and the task discarding under the given communication delay. Simulation is performed under the various communication delays, and the results show the effectiveness of the proposed method.

关键词： task mapping IoT system integer linear programming

来源：评论

学校读者我要写书评

暂无评论

Construction of reversible integer codes with large moduli via Chinese remainder theorem 17

Construction of reversible integer codes with large moduli v...

引用

17th International Symposium on Information Theory and its Applications (ISITA)

作者： Ojiro, Norifumi Matsui, Hajime Toyota Technol Inst Nagoya Aichi Japan

ISBN: (纸本)9784885523410

The codes over rational integer residue rings are called integer codes. In this paper, we give a necessary and sufficient condition concerning the generator matrices when integer codes are to be reversible and show that their reversibility is preserved from the decomposition of integer codes by Chinese remainder theorem. This brings an efficient method for constructing of reversible integer codes with large moduli. Using this method, we enumerate reversible self-dual integer codes of length 3,4 with various moduli. Further, we claim that reversible and self-dual integer codes produce reversible and unimodular lattices, respectively. As a result, we see that the extended binary Hamming code produces the even unimodular lattice of rank 8 and in particular this lattice is reversible, and furthermore the lattice induces an extremal Type II integer code of length 8 with modulus 4.

关键词： integer linear programming

来源：评论

学校读者我要写书评

暂无评论

The Mutex Watershed and its Objective: Efficient, Parameter-Free Graph Partitioning

引用

IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE 2021年第10期43卷 3724-3738页

作者： Wolf, Steffen Bailoni, Alberto Pape, Constantin Rahaman, Nasim Kreshuk, Anna Kothe, Ullrich Hamprecht, Fred A. Heidelberg Univ HCI IWR D-69120 Heidelberg Germany EMBL D-69117 Heidelberg Germany

Image partitioning, or segmentation without semantics, is the task of decomposing an image into distinct segments, or equivalently to detect closed contours. Most prior work either requires seeds, one per segment;or a threshold;or formulates the task as multicut / correlation clustering, an NP-hard problem. Here, we propose an efficient algorithm for graph partitioning, the "Mutex Watershed". Unlike seeded watershed, the algorithm can accommodate not only attractive but also repulsive cues, allowing it to find a previously unspecified number of segments without the need for explicit seeds or a tunable threshold. We also prove that this simple algorithm solves to global optimality an objective function that is intimately related to the multicut / correlation clustering integer linear programming formulation. The algorithm is deterministic, very simple to implement, and has empirically linearithmic complexity. When presented with short-range attractive and long-range repulsive cues from a deep neural network, the Mutex Watershed gives the best results currently known for the competitive ISBI 2012 EM segmentation benchmark.

关键词： Clustering algorithms Partitioning algorithms Image segmentation Image edge detection Merging Correlation Vegetation Image segmentation partitioning algorithms greedy algorithms optimization integer linear programming machine learning convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

Optimal Mobile IRS Deployment with Reinforcement Learning Encoder Decoders

Optimal Mobile IRS Deployment with Reinforcement Learning En...

引用

IEEE Global Communications Conference (GLOBECOM)

作者： Said, Adel Mounir Laroui, Mohammed Boucetta, Cherifa Afifi, Hossam Moungla, Hassine NTI Switching Dept Cairo Egypt Univ Paris Cite Lab Informat Paris Descartes LIPADE Paris France Univ Reims Res Ctr Informat & Commun Sci & Technol CReSTIC Reims France Telecom SudParis Inst Polytech Paris SAMOVAR Palaiseau France

ISBN: (纸本)9781665435406

Cellular deployment of new generations faces a coverage challenge due to the non-line-of-sight (NLOS) between clients' devices and base station (BS). Therefore, relaying on using the emerging technology;intelligent reflective surface (IRS) to reconfigure wireless signal propagation is considered the best solution that can address the mentioned challenge. Additionally, choosing the position of the IRS is not an easy task as the clients are mobile. Hence, there is a need for an efficient model to elect the best positions of the IRSs for a better network performance. In this work, two fold model is proposed to provide an automated solution to optimize IRS positions. The first one is the mixed integer linear programming (MILP) that solves the IRS positions problem in a classical way. Whereas the second one is based on the reinforcement learning optimization (RLO) with complex encoder and decoder network architecture to provide fast learning of the MILP results with a low mean square error. The proposed RLO model's validity is studied using 10 days of mobile dataset and actual cellular BSs' positions in the city of Rome (Italy). This study is based on the use of long short term memory (LSTM) and gated recurrent unit (GRU). The results show a significant performance of the proposed model based on LSTM compared to GRU.

关键词： IRS cellular deployment integer linear programming reinforcement learning optimization encoders/decoders long short term memory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：