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

Implementation of Secured and Robust DFT-Based Image Watermark Through Hybridization with decomposition algorithm

SN Computer Science 2021年第3期2卷 221页

作者： Begum, Mahbuba Uddin, Mohammad Shorif Department of Computer Science and Engineering Mawlana Bhashani Science and Technology University Tangail 1902 Bangladesh Department of Computer Science and Engineering Jahangirnagar University Dhaka 1342 Bangladesh

Robust as well as secure image watermarking is capable of providing a promising solution in many copyright protection applications. In this paper, an improved image watermarking scheme based on DFT with a decomposition algorithm is proposed. First, two dimensional (2D) Fast Fourier Transform (FFT) is applied to the host image, and then its singular value decomposition (SVD) is performed. Second, the watermark image is encrypted with a chaotic map for ensuring security against unauthorized detection, and then its 2D FFT and SVD are also performed. Third, the singular values of the watermark image are embedded into the singular values of the host image. The hybridization of DFT with SVD ensures the increasing performance of the watermarking system from the perspectives of visual distortion and robustness. Experimental results show that our proposed method is highly robust and also imperceptible with a large watermark size and increased security than the classical DFT-based methods. © 2021, The Author(s), under exclusive licence to Springer Nature Singapore Pte Ltd.

关键词： decomposition algorithm DFT Hybrid SVD

来源：评论

学校读者我要写书评

暂无评论

A variant of tuy's decomposition algorithm for solving e minimization problems

引用

Optimization 1991年第4期22卷 607-619页

作者： Thieu, Tran Vu institute of Mathematics Hanoi United Kingdom

We present an improved decomposition algorithm for solving the global optimization problemwhereX, Yare polyhedral convex sets inRp, Rqrespectively andfis a continuous concave function overX(pis assumed to be small as compared ton=p+q). This algorithm is a variant of Tuy's decomposition algorithm, with, however, a major improvement in the construction of the linear subproblems to be solved in each step. To take advantage of this improvement, the lay-out planning problem with concave cost and the case of bounded variableyare also considered.

关键词： concave minimization decomposition algorithm lay-out planning problem

来源：评论

学校读者我要写书评

暂无评论

Rotational Speed Oscillation Characteristic and decomposition algorithm of Torsional Vibration

Rotational Speed Oscillation Characteristic and Decompositio...

引用

7th World Congress on Intelligent Control and Automation

作者： Liu, Bin Jiang, Jinshui Shi, Peiming Univ Yanshan Inst Elect Engn Qinhuangdao Hebei Province Peoples R China

ISBN: (纸本)9781424421138

For analysing the torsional vibration characteristic of rotary mechanical drive system, a new highly active calculation decomposition algorithm was proposed by using series decoupled method. When the elastic driving shaft and motor shaft had speed oscillation, the decomposition algorithm could develop nonlinear differential equation into a series of algebraic equation and series solution had been gained, which could be calculated quickly. By taking the theoretical values of rotational speed oscillation obtained by the new decomposition algorithm as the forecasting control values of electric motor's rotational speed output, the torsional vibration of rotary mechanical drive system can be restrained effectively. The correctness of the decomposition algorithm was verified through the torsional vibration testing experiment.

关键词： Rotary mechanical Rotational speed oscillation Torsional vibration decomposition algorithm

来源：评论

学校读者我要写书评

暂无评论

An decomposition algorithm for Distribution Network Reconfiguration Schedule Considering Demand Response 10

An Decomposition Algorithm for Distribution Network Reconfig...

引用

IEEE PES Asia-Pacific Power and Energy Engineering Conference (APPEEC)

作者： Li, Zihao Wu, Wenchuan Zhang, Boming Tai, Xue Yang, Jinxi Han, Xuwen Zhang, Chen Qian, Yuhao Wang, Bo Tsinghua Univ Dept Elect Engineer Beijing 100084 Peoples R China Elect Power Co Ltd State Grid Jiangsu Yangzhou Yangzhou 225000 Jiangsu Peoples R China

ISBN: (纸本)9781538656860

Network reconfiguration and demand response can both reduce the loss and improve the security of the distribution networks (DNs). In this paper, we describe a day-ahead DN reconfiguration schedule model considering demand response, in which network reconfiguration is conducted by distribution system operator (DSO) while the demand response strategies are realized by customer aggregators. To preserve information privacy and reduce computational burden, a two-level decomposition & coordination algorithm is proposed to solve this model, which is based on a log-barrier cost function. In the upper level, the DSO optimizes the network reconfiguration schedule, calculates the barrier cost of every load bus and then sends it to the corresponding customer aggregator. In the lower level, every customer aggregator exploits available controllable demands like heat pump (HP), electric vehicle (EV) to minimize the nodal daily cost based on the barrier cost calculated in DSO. Numerical tests verify the promising convergence of this decomposition algorithm and show a reduction of the total cost in DN.

关键词： distribution network network reconfiguration demand response decomposition algorithm

来源：评论

学校读者我要写书评

暂无评论

A nonlinear decomposition algorithm

引用

Economics of Planning 1978年第2期14卷 115-124页

作者： Sandblom, Carl-Louis Department of Quantitative Methods Concordia University Montreal H4B 1R6 Quebec Loyola Campus 7141 Sherbrooke Street West Canada

来源：评论

学校读者我要写书评

暂无评论

The decomposition algorithm of AFS structure and its applications to failure diagnosis

The decomposition algorithm of AFS structure and its applica...

引用

IEEE Conference on Robotics, Automation and Mechatronics

作者： Liu, XD Wang, YB Liu, WQ Dalian Maritime Univ Dept Math & Phys Dalian 116026 Peoples R China

ISBN: (纸本)0780386450

A new fuzzy model for pattern recognition in failure diagnosis has been established by AFS(Axiomatic Fuzzy Sets) theory. But the complexity of systems brings this difficulty in analysis. By the analysis of the AFS structure for systems, the independent components for AFS structures is studied, and an algorithm of searching for the independent sub-AFS structures is proposed. The complexity of real world application system can be greatly reduced by this algorithm with failure diagnosis as an example. So the speed and accuracy of failure diagnosis can be improved. The example of failure diagnosis for a marine diesel engine demonstrates the advantages of this approach.

关键词： fuzzy set theory pattern recognition fault diagnosis diesel engines marine systems axiomatic fuzzy set theory decomposition algorithm pattern recognition marine diesel engine failure diagnosis

来源：评论

学校读者我要写书评

暂无评论

A decomposition algorithm for Byproduct Gases Scheduling in Iron and Steel Enterprises

A Decomposition Algorithm for Byproduct Gases Scheduling in ...

引用

International Conference on Renewable Energy and Environmental Technology (REET 2013)

作者： Shi, Cantao Liu, Zisheng Liu, Yuzhuo Zhou, Yongliang Univ Sci & Technol Beijing Dongling Sch Econ & Management Beijing 100083 Peoples R China

ISBN: (纸本)9783037859124

Concentrating on byproduct gas system with multiple pipeline networks, this paper established a mathematical model for byproduct gas scheduling (BGS) problem in iron and steel enterprises with consideration of supply priorities of consumption units. A decomposition algorithm is employed to transform the original model into an integer programming and a linear programming. The genetic algorithm is introduced as the solution mainframe to solve the integer programming problem and the linear programming problem iteratively. The result of practical-data-based experiment indicates that the proposed model and algorithm are feasible and effective.

关键词： iron and steel enterprises byproduct gas scheduling decomposition algorithm gene algorithm linear programming

来源：评论

学校读者我要写书评

暂无评论

A decomposition algorithm of VHDL-AMS simulation solver 5

A decomposition algorithm of VHDL-AMS simulation solver

引用

5th International Conference on ASIC

作者： Wang, JF Ye, YZ Heilongjiang Univ Sch Comp Sci & Technol Harbin 150080 Peoples R China

ISBN: (纸本)078037889X

The decomposition issue of tasks for VLSI simulation oil distributed memory, multi computers is discussed in this paper. Mathematical and physical analyses are given for exploiting the parallelisms of these operations. An efficient decomposition algorithm is proposed. Using this algorithm, we can decompose a large-scale circuit into N sub-circuits of similar size while keeping the interconnect set of nodes to a minimum, which is beneficial to dynamic load distribution and balance later. This algorithm can be implemented in a parallel environment processing. Some experimental results of this decomposition algorithm are presented. Finally, the conclusion and future work are included.

关键词： VHDL-AMS simulation solver decomposition algorithm parallel processing block bordered equations LU factorization

来源：评论

学校读者我要写书评

暂无评论

A novel robust exact decomposition algorithm for berth and quay crane allocation and scheduling problem considering uncertainty and energy efficiency

引用

OMEGA-INTERNATIONAL JOURNAL OF MANAGEMENT SCIENCE 2023年 118卷

作者： Chargui, Kaoutar Zouadi, Tarik Sreedharan, V. Raja El Fallahi, Abdellah Reghioui, Mohamed Int Univ Rabat Rabat Business Sch BEAR Lab Rocade 11100 Sala Al Jadida Morocco Cardiff Metropolitan Univ Sch Management 200 Western Ave Cardiff CF5 2YB Wales Univ Abdelmalek Essaadi ENSATE MOSIL Tetouan 2222 Morocco Univ Abdelmalek Essaadi MOSIL ENCGT Tangier Morocco Woxsen Univ Sch Business Sangareddy Telangana India

In container terminals, electricity price variation has a tangible impact on the operating cost of port equipment, especially the quay crane (QC). Accordingly, significant operational cost savings could be realized via careful planning. This study addresses, for the first time, berth allocation and QC assignment and scheduling problem (BACASP) considering energy price variations. A novel mathematical model is developed to minimize both energy costs and vessel tardiness. Furthermore, we consider the uncertainty in QC processing time and vessel arrival time, based on which we propose a robust formulation that optimizes the worst-case scenario. This study also highlights why robustness is essential for cost-cutting considering the energy prices in the BACASP. The model is unable to achieve optimality using CPLEX, even for small instances. Thus, a novel exact decomposition algorithm is proposed to solve the problem over a reasonable computational time. Its novelty lies in four proposed strengthening procedures designed and embedded within the algorithm. To test the algorithm, several instances are generated based on the literature and real data of a port partner. Then, several experiments are conducted to highlight the impact of implementing the four strengthening procedures and demonstrate how considering energy constraints within the BACASP leads to significant cost savings.& COPY;2023 Elsevier Ltd. All rights reserved.

关键词： Maritime industry Berth allocation and quay crane assignment and scheduling problem (BACASP) Energy efficiency Robust optimization decomposition algorithm

来源：评论

学校读者我要写书评

暂无评论

Reflection of and vision for the decomposition algorithm development and application in earth observation studies using PolSAR technique and data

引用

REMOTE SENSING OF ENVIRONMENT 2021年 261卷 112498-112498页

作者： Duan, Dingfeng Wang, Yong Univ Elect Sci & Technol China Sch Resources & Environm 2006 Xiyuan Ave Chengdu 611731 Peoples R China East Carolina Univ Dept Geog Planning & Environm Greenville NC 27858 USA

After reflecting on the past decomposition studies using the polarimetric synthetic aperture radar (PolSAR) technique and data in Earth observation (EO) studies, three primary issues are identified. Elements C-12 and C-32 of a covariance matrix, [C], are essential in the decomposition and cannot be ignored. Existing algorithms cannot adequately distinguish urban targets with large azimuth orientation angles from vegetation. The algorithms are complex in the formulation and procedure. To resolve the issues and envision future algorithm development, we have articulated three key modules. They are a separation factor to separate an azimuthally symmetric or asymmetric target, a diplane to model an asymmetric target in an urban area, and a procedure to derive an equivalent azimuth-orientation angle for the diplane. Then, a four-component decomposition algorithm was developed. The algorithm has been applied to multiple airborne and spaceborne PolSAR C- and L-band datasets covering areas in Canada, France, Morocco, and the USA. The primary radar target types included trihedral and dihedral corner reflectors (CRs), airport runway/taxiway, urban targets with azimuth-orientation angles ranging between 0 degrees and 45 degrees, ocean and inland water surfaces, city parks, grassland, forests, farmland, and desert. The separation factor delineates a symmetric or asymmetric target at a correct average rate of 92.7%. The diplane coupled with the derived equivalent azimuth-orientation angles correctly modeled radar backscatter from dihedral CRs and urban asymmetric targets. The algorithm delineated each type of ground target with an appropriate and dominant single, double, or volume scattering. Furthermore, the algorithm has four readily interpretable components, and its mathematical expression is not complicated. Therefore, the primary objectives to resolve the above three issues and to have an algorithm with well-balanced usability in EO studies and complexity in formulation and

关键词： An urban or a non-urban radar target Azimuth orientation angles of azimuthally symmetric or asymmetric targets decomposition algorithm Polarimetric SAR (PolSAR) technique and data

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：