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

International Applied-Computational-Electromagnetics-Society Symposium - China (ACES)

作者： Li, Xiaojie Dong, Zhiwen Chen, Xinlei Gu, Changqing Nanjing Univ Aeronaut & Astronaut Coll Elect & Informat Engn Nanjing Peoples R China Southest Univ Coll Elect & Informat Engn NUAA KLME Nanjing Peoples R China Southest Univ CIC FEMD NUIST State Key Lab Millimeter Waves Nanjing Peoples R China

ISBN: (纸本)9780996007894

This paper proposes a method for solving the monostatic radar cross section of the target with the iterative solution of the method of moments. In this method, the randomized algorithm is adapted to enhance the computational efficiency of the matrix solution step by compressing the impedance matrix and the excitation matrix. The results of calculation examples show that the method is efficient and reliable.

关键词： Method of moments (MoM) Randomized algorithm iterative algorithm Radar Cross Section (RCS)

来源：评论

学校读者我要写书评

暂无评论

A survey on the algorithm and development of multiple sequence alignment

引用

BRIEFINGS IN BIOINFORMATICS 2022年第3期23卷 bbac069-bbac069页

作者： Zhang, Yongqing Zhang, Qiang Zhou, Jiliu Zou, Quan Chengdu Univ Informat Technol Sch Comp Sci Chengdu Peoples R China Univ Elect Sci & Technol China Inst Fundamental & Frontier Sci Chengdu 610054 Peoples R China

Multiple sequence alignment (MSA) is an essential cornerstone in bioinformatics, which can reveal the potential information in biological sequences, such as function, evolution and structure. MSA is widely used in many bioinformatics scenarios, such as phylogenetic analysis, protein analysis and genomic analysis. However, MSA faces new challenges with the gradual increase in sequence scale and the increasing demand for alignment accuracy. Therefore, developing an efficient and accurate strategy for MSA has become one of the research hotspots in bioinformatics. In this work, we mainly summarize the algorithms for MSA and its applications in bioinformatics. To provide a structured and clear perspective, we systematically introduce MSA's knowledge, including background, database, metric and benchmark. Besides, we list the most common applications of MSA in the field of bioinformatics, including database searching, phylogenetic analysis, genomic analysis, metagenomic analysis and protein analysis. Furthermore, we categorize and analyze classical and state-of-the-art algorithms, divided into progressive alignment, iterative algorithm, heuristics, machine learning and divide-and-conquer. Moreover, we also discuss the challenges and opportunities of MSA in bioinformatics. Our work provides a comprehensive survey of MSA applications and their relevant algorithms. It could bring valuable insights for researchers to contribute their knowledge to MSA and relevant studies.

关键词： multiple sequence alignment progressive alignment iterative algorithm heuristic

来源：评论

学校读者我要写书评

暂无评论

Should competing firms offer 'Buy n times, get one free' loyalty programs? A game-theoretic analysis

引用

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY 2020年第2期71卷 280-300页

作者： Bazargan, Amirhossein Zolfaghari, Saeed Karray, Salma Ryerson Univ Dept Mech & Ind Engn 350 Victoria St Toronto ON M5B 2K3 Canada UOIT Fac Business & Informat Technol Oshawa ON Canada

This study investigates the profitability of 'Buy n, get one free' loyalty programs (LPs) for competing firms deciding on whether to offer such LP. We use a game-theoretic approach and obtain the equilibrium by considering four subgames;two symmetric ones where both firms either offer or do not offer a LP, and two asymmetric ones where only one firm offers a LP. We derive the demand using an analytical choice model. Then, we obtain the firms' optimal decision variables (prices and reward periods) and profits for each subgame under different combinations of behavioral parameters of time and reward valuations for both symmetric and asymmetric production cost for the firms. The results show that when customers highly value reward but not time, offering loyalty programs is a dominant strategy. However, under different market conditions, firms face a prisoner dilemma or find that not offering a LP is a dominant equilibrium.

关键词： OR in marketing iterative algorithm multinomial logit models loyalty programs game theory

来源：评论

学校读者我要写书评

暂无评论

Progressive Colorization via iterative Generative Models

引用

IEEE SIGNAL PROCESSING LETTERS 2020年 27卷 2054-2058页

作者： Zhou, Jinjie Hong, Kai Deng, Tao Wang, Yuhao Liu, Qiegen Nanchang Univ Dept Elect Informat Engn Nanchang 330031 Jiangxi Peoples R China

Colorization is the process of coloring monochrome images. It has been widely used in photo processing and scientific illustration. However, colorizing grayscale images is an intrinsic ill-posed and ambiguous problem, with multiple plausible solutions. To address this issue, we develop a novel progressive automatic colorization via iterative generative models (iGM) that can produce satisfactory colorization in an unsupervised manner. In particular, the generative model is exploited in multi-color spaces (e.g., RGB, YCbCr) jointly and enforced with linearly autocorrelative constraint. This is regarded as the key prior information to pave the way for producing the most probable colorization in high-dimensional space. Experiments on indoor and outdoor scenes reveal that iGM produces more realistic and finer results, compared to state-of-the-arts.

关键词： Colorization generative model unsupervised learning multi-color spaces iterative algorithm

来源：评论

学校读者我要写书评

暂无评论

Some fixed point results on Nb-cone metric spaces over Banach algebra

引用

ADVANCES IN DIFFERENCE EQUATIONS 2020年第1期2020卷 1-15页

作者： Fernandez, Jerolina Malviya, Neeraj Mitrovic, Zoran D. Hussain, Azhar Parvaneh, Vahid Bhopal Sch Social Sci Dept Sci Bhopal 462024 MP India Govt Coll Dept Math Timarni MP India Ton Duc Thang Univ Nonlinear Anal Res Grp Ho Chi Minh City Vietnam Ton Duc Thang Univ Fac Math & Stat Ho Chi Minh City Vietnam Univ Sargodha Dept Math Sargodha 40100 Pakistan Islamic Azad Univ Dept Math Gilan E Gharb Branch Gilan E Gharb Iran

The main aim of this paper is to introduce the concept of N-b-cone metric spaces over a Banach algebra as a generalization of N-cone metric spaces over a Banach algebra and b-metric spaces. Also, we study some coupled common fixed point theorems for generalized Lipschitz mappings in this framework. Finally, we give an example and an application to the existence of solutions of integral equations to illustrate the effectiveness of our generalizations. Some results in the literature are special cases of our results.

关键词： N-b-cone metric spaces over Banach algebra c-sequence iterative algorithm Coupled fixed points

来源：评论

学校读者我要写书评

暂无评论

A ROBUST REDUCED-ORDER OBSERVERS DESIGN APPROACH FOR LINEAR DISCRETE PERIODIC SYSTEMS

引用

JOURNAL OF INDUSTRIAL AND MANAGEMENT OPTIMIZATION 2020年第6期16卷 2799-2812页

作者： Lv, Lingling He, Wei Liu, Xianxing Zhang, Lei North China Univ Water Resources & Elect Power Inst Elect Power Zhengzhou 450011 Peoples R China Henan Univ Key Lab Big Data Anal & Proc Henan Prov Zhengzhou 450011 Peoples R China

This paper investigates the problem of designing reduced-order observers for linear discrete-time periodic (LDP) systems. In case that the linear discrete-time periodic system is observable, an algebraic equivalent system is obtained by non-singular linear transformation, and the partial states to be observed are separated simultaneously. Then the considered problem is transformed into the problem of solving a class of periodic Sylvester matrix equation and an iterative algorithm for periodic reduced-order state observers design is derived. In addition, robust consideration based on periodic reduced-order state observers for LDP systems is also conducted. At last, one numerical example is worked out to illustrate the effectiveness of the proposed approaches.

关键词： Linear discrete-time periodic (LDP) system reduced-order observers iterative algorithm robustness

来源：评论

学校读者我要写书评

暂无评论

Texture and colour region separation based image retrieval using probability annular histogram and weighted similarity matching scheme

引用

IET IMAGE PROCESSING 2020年第7期14卷 1303-1315页

作者： Pradhan, Jitesh Kumar, Sumit Pal, Arup Kumar Banka, Haider Indian Inst Technol Indian Sch Mines Dept Comp Sci & Engn Dhanbad 826004 Jharkhand India

Content-based image retrieval (CBIR) uses primitive image features for retrieval of similar images from a dataset. Generally, researchers extract these visual features from the whole image. Therefore, the extracted features contain overlapped information of texture, colour, and shape features, and it is a critical challenge in the field of CBIR. This problem can be overcome by extracting the colour features from the colour as well as shape and texture features from the intensity dominant part only. In this study, the authors have proposed an iterative algorithm to separate colour and texture dominant part of the image into two different images. Here, a combination of edge maps and gradients has been used to achieve separate colour and texture images. Further, scale-invariant feature transform and 2D dual-tree complex wavelet transform has been realised to extract unique shape and texture features from the texture image. Simultaneously, a probability-based semantic centred annular histogram has been suggested to extract unique colour features from the colour image. Finally, a novel weighted distance-based feature comparison scheme has been proposed for similarity matching and retrieval. All the image retrieval experiments have been carried out on seven standard datasets and demonstrated significant improvements over other state-of-arts CBIR systems

关键词： wavelet transforms trees (mathematics) image texture image colour analysis feature extraction content-based retrieval probability image retrieval shape recognition image matching edge detection iterative methods colour region separation based image retrieval content-based image retrieval system CBIR primitive image visual features colour dominant part texture feature intensity dominant part iterative algorithm texture dominant part probability-based semantic centred annular histogram unique colour features weighted distance-based feature comparison scheme shape feature similarities query image database images image retrieval experiments texture image datasets retrieval performances unique shape feature extraction weighted similarity matching scheme scale-invariant feature transform two-dimensional dual-tree complex wavelet transform edge maps

来源：评论

学校读者我要写书评

暂无评论

Frictional receding contact problem of a functionally graded layer resting on a homogeneous coated half-plane

引用

ARCHIVE OF APPLIED MECHANICS 2020年第9期90卷 2113-2131页

作者： Comez, Isa El-Borgi, Sami Yildirim, Bora Karadeniz Tech Univ Dept Civil Engn TR-61080 Trabzon Turkey Texas A&M Univ Qatar Mech Engn Program Engn BldgPOB 23874 Doha Qatar Hacettepe Univ Mech Engn Dept Ankara Turkey

This paper investigates the frictional receding contact problem between a functionally graded (FG) layer resting on a homogeneous coated half-plane when the system indented by a rigid cylindrical punch. The shear modulus of the upper graded layer is assumed to vary exponentially in the depth direction. Upon loading, the advancing contact and receding contact occur between the FG layer and rigid punch and between the FG layer and coating, respectively. Under the assumptions of sliding contact, the shear and normal contact stresses are related through Coulomb's law of friction. The contact problem is converted analytically using Fourier integral transforms and the proper boundary conditions into a system of two singular integral equations. The unknowns of these integral equations consist of the contact stresses under the punch and between the FG layer and coating as well as the dimensions of the contact zones. The Gauss-Jacobi quadrature collocation method is then employed to transform the singular integral equations into a system of nonlinear equations which are solved using an appropriate iterative algorithm to compute the contact stresses and the dimensions of the contact areas. The main purpose of this paper is to examine the influence of several parameters on the upper and lower contact stresses, which include the material inhomogeneity parameter, friction coefficient, punch radius, applied load, thickness of homogeneous layer, shear modulus of homogeneous layer and shear modulus of homogeneous half-plane. One of the most important conclusions from this study is that the contact stresses and contact areas can be controlled with the addition of the homogeneous layer.

关键词： Graded layer Receding frictional contact Homogeneous layer Singular integral equations iterative algorithm

来源：评论

学校读者我要写书评

暂无评论

A Set of Point-Targets-Based Polarimetric Calibration Methods Based on General Polarimetric System Model

引用

IEEE JOURNAL OF SELECTED TOPICS IN APPLIED EARTH OBSERVATIONS AND REMOTE SENSING 2020年 13卷 2502-2519页

作者： Liang, Weibin Chinese Acad Sci Key Lab Technol Geospatial Informat Proc & Applic Inst Elect Beijing 100190 Peoples R China

Freeman proposed a general polarimetric system model in 1991 for the characterization and calibration of fully polarimetric synthetic aperture radar (SAR) systems. The model contains three-channel imbalance parameters and four cross-talk parameters, which together describe the polarimetric distortion in a practical imaging radar more accurately than the conventional six-parameter model by including a third imbalance parameter, namely gamma. This parameter is independent of the others and represents the ratio of the product of the transfer functions of the copolarized channels to the product of the transfer functions of the cross-polarized channels. Nonnegligible errors may arise if this parameter is not estimated and corrected, but since this parameter was proposed, there has been very little research into calibration methods that account for gamma. In this article, based on the general polarimetric system model in the 2 x 2 matrix form, we propose a gamma-factor estimation method based on an active radar calibrator (ARC) or a dihedral corner reflector. We also propose a universal iterative polarimetric calibration algorithm based on three pieces of calibration equipment, which can be all ARCs, all corner reflectors (CRs), or a combination of ARCs and CRs. The convergence of this iterative algorithm is proven mathematically. These alternatives provide a variety of practical calibration method options for polarimetric SAR calibration under different conditions. Finally, the simple calibration method based on a single piece of calibration equipment and the iterative algorithm based on three pieces of calibration equipment are verified by the polarimetric calibration experiment data from the GaoFen-3 satellite.

关键词： Calibration Radar polarimetry Distortion Spaceborne radar Synthetic aperture radar Transfer functions Calibration iterative algorithm GaoFen-3 polarimetric SAR polarimetric calibration polarimetric system model synthetic aperture radar (SAR)

来源：评论

学校读者我要写书评

暂无评论

Blind atmospheric turbulence deconvolution

引用

IET IMAGE PROCESSING 2020年第14期14卷 3422-3432页

作者： Deledalle, Charles-Alban Gilles, Jerome Univ Calif San Diego Elect & Comp Engn Dept 9500 Gilman Dr La Jolla CA 92093 USA San Diego State Univ Dept Math & Stat 5500 Campanile Dr San Diego CA 92182 USA

A new blind image deconvolution technique is developed for atmospheric turbulence deblurring to overcome limitations of 'generic' blind deconvolution algorithms that do not take into account the complicated physics of the turbulence. The originality of the proposed approach relies on an actual physical model, known as the Fried kernel, that quantifies the impact of the atmospheric turbulence on the optical resolution of images. While the original expression of the Fried kernel can seem cumbersome at first sight, the authors show that it can be reparameterised in a much simpler form. This simple expression allows to efficiently embed this kernel in the proposed blind atmospheric turbulence deconvolution (BATUD) algorithm. BATUD is an iterative algorithm that alternately performs deconvolution and estimates the Fried kernel by jointly relying on a Gaussian mixture model prior to natural image patches and controlling for the square Euclidean norm of the Fried kernel. Numerical experiments show that the proposed blind deconvolution algorithm behaves well in different simulated turbulence scenarios, as well as on real images. Not only BATUD outperforms state-of-the-art approaches used in atmospheric turbulence deconvolution in terms of image quality metrics but is also faster.

关键词： atmospheric turbulence deconvolution image restoration iterative methods Gaussian processes iterative algorithm Fried kernel natural image patches BATUD image quality metrics blind image deconvolution technique atmospheric turbulence deblurring generic blind deconvolution algorithms complicated physics actual physical model blind atmospheric turbulence deconvolution algorithm simulated turbulence scenarios Gaussian mixture model

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：