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

An effective embedding algorithm for blind image watermarking technique based on Hessenberg decomposition

APPLIED INTELLIGENCE 2023年第21期53卷 25467-25489页

作者： Nha, Phuong Thi Thanh, Ta Minh Phong, Nguyen Tuan Le Quy Don Tech Univ 236 Hoang Quoc Viet Hanoi Vietnam

For digital image copyright protection, watermarking techniques are a promising solution and are of interest to many researchers. In watermarking schemes based on matrix transformation, the embedding element and embedding formula play a very important role in maintaining the quality of a watermark image and the robustness of the watermark. In this paper, a blind image watermarking scheme based on Hessenberg decomposition, where the improvement focuses on the embedding element and embedding formula, is proposed. First, the structure of the Hessenberg factorization is analysed to obtain the most suitable embedding element. Accordingly, this is the first time that the element on the second row and the second column of the upper Hessenberg matrix is selected as an embedding element in a Hessenberg-based image watermarking scheme because of its energy concentration and stability. Second, an improved embedding formula is proposed to address the limitations of previous studies. In the proposed formula, constraint conditions are added to limit the change in all blocks, and a scaling factor is applied to guarantee a trade-off between invisibility and robustness. Here, the scaling factor is carefully calculated by repeating various experiments under different image attacks to achieve an optimal value. Therefore, our proposed embedding formula not only minimizes the modification of the host image after embedding but also helps maintain the robustness of the extracted watermark. Third, to increase the security of the proposed scheme, the watermark image is encoded by the Arnold transform before it is embedded into the host image. The experimental results show that the proposed approach defeats the compared methods in terms of invisibility and execution time. Moreover, the proposed scheme can resist most common attacks when the average normalized correlation value is higher than 0.93 and the extracted watermarks are always clearly recognized.

关键词： Image watermarking Copyright protection Hessenberg decomposition embedding algorithm Arnold transform

来源：评论

学校读者我要写书评

暂无评论

Virtual Network embedding algorithm Based Connective Degree and Comprehensive Capacity

Virtual Network Embedding Algorithm Based Connective Degree ...

引用

9th International Conference on Intelligent Computing (ICIC)

作者： Yuan, Ying Wang, Cuirong Zhu, Na Wan, Cong Wang, Cong Northeastern Univ Sch Informat Sci & Engn Shenyang 110004 Peoples R China Sch Northeastern Univ Qinhuangda 066004 Peoples R China Sch Qinhuangda Inst Technol Qinhuangda 066004 Peoples R China

ISBN: (纸本)9783642394799;9783642394782

Network virtualization allows multiple virtual networks to coexist on a shared physical substrate infrastructure. As far as possible to support more virtual networks on a shared substrate network, efficient physical resource utilization is crucial. This paper presents a novel approach to increase utility of the substrate network. As an optimization problem, such virtual network embedding problem is formulated as an integer linear programming model. By introducing a sliding window with priority for VN requests, the algorithm embeds virtual nodes based on both connective degree and comprehensive capacity. Experimental results show that comparing with the existing VNE algorithm the proposed algorithm achieve higher VNs accept ratio and gain higher revenue-cost ratio for substrate network.

关键词： network virtualization embedding algorithm virtual network connective degree sliding window

来源：评论

学校读者我要写书评

暂无评论

Minimum Congestion and Wirelength of embedding the nth Cartesian Product of K4 into Various Kinds of Grid Networks

引用

JOURNAL OF INTERCONNECTION NETWORKS 2025年第2期25卷

作者： Li, Pingping Zhang, Mingzu Guo, Litao Xinjiang Univ Dept Coll Math & Syst Sci Urumqi 830046 Peoples R China Xiamen Univ Technol Dept Math Xiamen 361024 Peoples R China

embedding an interconnection network into another network is one of the main problems in parallel processing and computing systems. Interconnection networks in multiprocessing systems facilitate effective communication among various system components. Obtaining the minimum cutwidth, congestion, and wirelength in graph embedding problems is of great significance for network design and architecture, where the minimum is taken over all embedding of guest graphs into host graphs, and addressing these issues can reduce time and cost in embedded design. This work aims to accurately calculate the minimum congestion and wirelength for the K-4(n) (the nth Cartesian product of K-4) layout into 1-dimensional, 2-dimensional, and 3-dimensional grids by the optimal solution of edge isoperimetric problem on K-4(n).

关键词： Graph embedding grid embedding congestion wirelength edge isoperimetric problem embedding algorithm

来源：评论

学校读者我要写书评

暂无评论

A Linear algorithm for embedding of Cycles in Crossed Cubes with Edge-Pancyclic

引用

JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 2015年第4期31卷 1347-1355页

作者： Tsai, Chang-Hsiung Lai, Chia-Jui Natl Dong Hwa Univ Dept Comp Sci & Informat Engn Shoufeng 974 Hualien Taiwan

In this paper, we consider the problem of embedding a cycle containing number of nodes from 4 to 2(n) through a prescribed edge in an n-dimensional crossed cube CQ(n). The main contribution of this paper is providing a systematic O(l) algorithm to find a cycle of length l containing (u, v) in CQ(n) for any (u, v) is an element of E(CQ(n)) nd any integer l with 4 <= l <= 2(n).

关键词： interconnection network cycles embedding edge-pancyclic embedding algorithm crossed cubes

来源：评论

学校读者我要写书评

暂无评论

A Perturbation algorithm for embedding Virtual Data Centers in Multipath Networks

A Perturbation Algorithm for Embedding Virtual Data Centers ...

引用

IEEE Global Communications Conference (GLOBECOM)

作者： Zou, Jian Yan, Fangfang Lee, Tony T. Hu, Weisheng Shanghai Jiao Tong Univ State Key Lab Adv Opt Commun Syst & Network Shanghai Peoples R China

ISBN: (纸本)9781479935123

Network virtualization supports predicted network performance for applications by providing tenants with a virtual data center in multi-tenant data centers. The Hose model was recently extended for the virtual network abstraction and deployed in an Oktopus system, which offers the trade-off between cost and network performance. embedding algorithms based on Oktopus model were well studied in the single-root tree topology. In this paper, we investigate congestion-aware allocation of virtual data centers in multipath networks. First, we formulate bandwidth constraints with linear programming, and provide a complete solution with exhaustive searching. Next, to reduce time complexity, we propose a perturbation algorithm to VM placement, which detects the bandwidth bottleneck of the current virtual machine placement and then adjusts the assignment to reduce congestion. The perturbation algorithm is compatible with both load-balanced and single-path routing algorithms. We compare the performance of the exhaustive searching algorithm and perturbation algorithm with load-balanced or single-path routing by simulations. The perturbation algorithm with load-balanced routing performs close to the exhaustive searching algorithm while significantly reduces the time complexity. Therefore, it offers a good tradeoff between time complexity and network performance.

关键词： data center virtualization embedding algorithm multipath routing perturbation

来源：评论

学校读者我要写书评

暂无评论

A Novel algorithm for embedding Dynamic Virtual Network Request 2

A Novel Algorithm for Embedding Dynamic Virtual Network Requ...

引用

2nd International Conference on Information Science and Control Engineering

作者： Yuan, Ying Wang, Cuirong Wang, Cong Zhang, Bin Zhu, Shimin Zhu, Na Northeastern Univ Informat Sci & Engn Shenyang Peoples R China Northeastern Univ Qinhuangdao Qinhuangdao Peoples R China Northeastern Univ Qinhuangdao Sch Comp Ctr Qinhuangdao Peoples R China Sch Qinhuangdao Inst Technol Qinhuangdao Peoples R China

ISBN: (纸本)9781467368506

Most of the current researches in virtual network embedding field often assume that the VN requests are static. However, in practical cases, virtual network requests on substrate resources change dynamically over time. To support such dynamical feature, we model the VNE problem as a mixed linear programming problem and use multiple queues to store different types of virtual network requests respectively. The whole algorithm named VNE-DR is presented with optimization solution for different request types and multi queue scheduling. The approach allows multiple virtual nodes of the same virtual network can be embedded into the same physical node as long as there is enough resource capacity. Simulation results show that comparing with the existing virtual network embedding algorithms the proposed algorithm performs better in embedding cost.

关键词： network virtualization embedding algorithm virtual network dynamic virtual network request

来源：评论

学校读者我要写书评

暂无评论

An Efficient algorithm for embedding Two-Dimensional Tori into Balanced Hypercubes

引用

PARALLEL PROCESSING LETTERS 2022年第1N02期32卷 2250002-2250002页

作者： Lai, Pao-Lien Chen, Kuan-Ting Chang, Chien-Ping Hsu, Hong-Chun Natl Dong Hwa Univ Dept Comp Sci & Informat Engn Hualien Taiwan China Univ Technol Coll Comp Sci Hsinchu Taiwan Tzu Chi Univ Dept Med Informat Hualien Taiwan

Balanced hypercube is a variant of the hypercube structure;it offers desirable properties such as connectivity, diameter, and fault-tolerance. Cycles and tori are popular interconnection topologies and have been widely used in distributed-memory parallel computers. Scholars have developed diverse and numerous parallel algorithms of cycles and tori. This paper proposes an efficient algorithm, called reflected edge label sequence, to generate cycle structures in balanced hypercubes. With this algorithm, we can embed cycles of length 2(2k+1), 1 <= k < n, into an n-dimensional balanced hypercube. The corresponding algorithm for embedding 2-dimensional 2(2k) x 2(2k) tori can be constructed on the basis of this approach, and the time complexity is linear with respect to the size of a balanced hypercube.

关键词： Interconnection networks balanced hypercube cycle torus embedding algorithm double reflected edge label sequence cycle pattern generator

来源：评论

学校读者我要写书评

暂无评论

A Perturbation algorithm for embedding Virtual Data Centers in Multipath Networks

A Perturbation Algorithm for Embedding Virtual Data Centers ...

引用

IEEE Global Communications Conference

作者： Jian Zou Fangfang Yan Tony T. Lee Weisheng Hu State Key Laboratory of Advanced Optical Communication Systems and Network Shanghai Jiao Tong University

ISBN: (纸本)9781479935130

关键词： Data center Virtualization embedding algorithm Multipath routing Perturbation

来源：评论

学校读者我要写书评

暂无评论

Congestion-Aware embedding of Heterogeneous Bandwidth Virtual Data Centers With Hose Model Abstraction

引用

IEEE-ACM TRANSACTIONS ON NETWORKING 2017年第2期25卷 806-819页

作者： Yan, Fangfang Lee, Tony T. Hu, Weisheng Shanghai Jiao Tong Univ State Key Lab Adv Opt Commun Syst & Networks Shanghai 200030 Peoples R China

Predictable network performance is critical for cloud applications and can be achieved by providing tenants a dedicated virtual data center (VDC) with bandwidth guarantee. Recently, the extended Hose model was applied to the VDC abstraction to characterize the tradeoff between cost and network performance. The acceptability determination problem of a VDC with heterogeneous bandwidth demand was proved to be NP-complete, even in the simple tree topology. In this paper, we investigate the embedding problem for heterogeneous bandwidth VDC in substrate networks of general topology. The embedding problem involves two coupled sub-problems: virtual machine (VM) placement and multipath route assignment. First, we formulate the route assignment problem with linear programming to minimize the maximum link utilization, and provide K-widest path load-balanced routing with controllable splitting paths. Next, we propose a polynomial-time heuristic algorithm, referred to as the perturbation algorithm, for the VM placement. The perturbation algorithm is congestion-aware as it detects the bandwidth bottlenecks in the placement process and then selectively relocates some assigned VMs to eliminate congestion. Simulation results show that our algorithm performs better in comparison with the existing well-known algorithms: first-fit, next-fit, and greedy, and very close to the exponential-time complexity backtracking algorithm in typical data center network architectures. For the tree substrate network, the perturbation algorithm performs better than the allocation-range algorithm. For the homogeneous bandwidth VDC requests, the perturbation algorithm produces a higher success rate than the recently proposed HVC-ACE algorithm. Therefore, it provides a compromised solution between time complexity and network performance.

关键词： Data center virtualization embedding algorithm multipath routing perturbation

来源：评论

学校读者我要写书评

暂无评论

Survivable virtual optical network embedding with probabilistic network-element failures in elastic optical networks

引用

OPTICAL FIBER TECHNOLOGY 2015年 23卷 90-94页

作者： Yang, Hui Cheng, Lei Luo, Guangjun Zhang, Jie Zhao, Yongli Ding, Huixia Zhou, Jing Wang, Yang Beijing Univ Posts & Telecommun State Key Lab Informat Photon & Opt Commun Beijing 100876 Peoples R China China Elect Power Res Inst Beijing 100192 Peoples R China

The elastic optical networks can elastically allocate spectrum tailored for various bandwidth requirements. In addition, different virtual optical networks (VONs) formed by different applications or service providers need to be embedded on the common physical optical network, it brings virtual optical network embedding (VONE) problem. There is no precise standard to measure the survivability of VON from the failure probability view and take minimum VON failure probability as an objective in a VONE problem. In this paper, we investigate a survivable VONE problem from a new perspective. Considering probabilistic physical network-element failures, a novel metric, named virtual optical network failure probability (VON-FP), is introduced to evaluate the survivability of VONs in elastic optical networks. Moreover, a failure-probability-aware virtual optical network embedding (FPA-VONE) algorithm is proposed to deploy VONs on the physical network elements with small failure probability, and finally to decrease the VON-FP and enhance the spectrum utilization effectively. (C) 2015 Elsevier Inc. All rights reserved.

关键词： Survivability Failure probability Virtual optical network Elastic optical networks embedding algorithm

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：