Recently, Ghanbari and Mahdavi-Amiri (Appl Math Model 34:3363-3375, 2010) gave the general compromised solution of an LR fuzzy linear system using abs algorithm. Here, using this general solution, we solve quadratic p...
详细信息
Recently, Ghanbari and Mahdavi-Amiri (Appl Math Model 34:3363-3375, 2010) gave the general compromised solution of an LR fuzzy linear system using abs algorithm. Here, using this general solution, we solve quadratic programming problems with fuzzy LR variables. We convert fuzzy quadratic programming problem to a crisp quadratic problem by using general solution of fuzzy linear system. By using this method, the crisp optimization problem has fewer variables in comparison with other methods, specially when rank of the coefficient matrix is full. Thus, solving the fuzzy quadratic programming problem by using our proposed method is computationally easier than the solving fuzzy quadratic programming problem by using ranking function. Also, we study the fuzzy quadratic programming problem with symmetric variables. We show that, in this case, the associate quadratic programming problem is a convex problem, and thus, we able to find the global optimal.
Fifth Generation (5G) networks provide high throughput and low delay, contributing to enhanced Quality of Experience (QoE) expectations. The exponential growth of multimedia traffic pose dichotomic challenges to simul...
详细信息
ISBN:
(纸本)9783903176317
Fifth Generation (5G) networks provide high throughput and low delay, contributing to enhanced Quality of Experience (QoE) expectations. The exponential growth of multimedia traffic pose dichotomic challenges to simultaneously satisfy network operators, service providers, and end-user expectations. Building QoE-aware networks that provide run-time mechanisms to satisfy end-users' expectations while the end-to-end network Quality of Service (QoS) varies is challenging, and motivates many ongoing research efforts. The contribution of this work is twofold. Firstly, we present a reproducible data-riven framework with a series of pre-installed Dynamic Adaptive Streaming over HTTP (DASH) tools to analyse state-of-art Adaptive Bitrate Streaming (abs) algorithms by varying key QoS parameters in static and mobility scenarios. Secondly, we introduce an interactive Jupyter notebook and Binder service providing a live analytical environment, which processes the output dataset of the framework and compares the relationship of five QoE models, three QoS parameters (RTT, throughput, packets), and seven different video KPIs.
In view of current situation of bad data synchronization,image blurring and tracking station stability in tracking target identification,a kind of tracking target identification model based on multiple algorithms was ...
详细信息
In view of current situation of bad data synchronization,image blurring and tracking station stability in tracking target identification,a kind of tracking target identification model based on multiple algorithms was put forward,firstly establishing the image degradation model,using the wavelet algorithm for image preprocessing,doing image edge segmentation by using Robert algorithm after pretreatment,then using the maximum variance threshold method for image threshold segmentation,then extracting target features from the segmented image,and finally using the abs algorithm to finish target *** proved the proposed model practical and effective.
This paper is to explore a model of the abs algorithms dealing with the solution of a class of systems of linear stochastic equations A xi=eta when eta is a m-dimensional normal distribution. It is shown that the step...
详细信息
This paper is to explore a model of the abs algorithms dealing with the solution of a class of systems of linear stochastic equations A xi=eta when eta is a m-dimensional normal distribution. It is shown that the stepsize alpha(i) is distributed as N(u(i), sigma(i)) (being ui the expected value of ai and si its variance) and the approximation to the solutions xi(i) is distributed as N-n(U-i, Sigma(i)) ( being U-i the expected value of xi(i) and Sigma(i) its variance), for this algorithm model.
In view of current situation of bad data synchronization, image blurring and tracking station stability in tracking target identification, a kind of tracking target identification model based on multiple algorithms wa...
详细信息
In view of current situation of bad data synchronization, image blurring and tracking station stability in tracking target identification, a kind of tracking target identification model based on multiple algorithms was put forward, firstly establishing the image degradation model, using the wavelet algorithm for image preprocessing, doing image edge segmentation by using Robert algorithm after pretreatment, then using the maximum variance threshold method for image threshold segmentation, then extracting target features from the segmented image, and finally using the abs algorithm to finish target tracking. Experiments proved the proposed model practical and effective.
In 1979, Gay proved that Broyden's methods, when used for n-square linear systems, terminate in at most 2n iterations (SIAM J. Numer Anal. 1979;16:623-630). Also, the abs methods were introduced in 1984 (Numer Mat...
详细信息
In 1979, Gay proved that Broyden's methods, when used for n-square linear systems, terminate in at most 2n iterations (SIAM J. Numer Anal. 1979;16:623-630). Also, the abs methods were introduced in 1984 (Numer Math. 1984;45:1361-1376). In this paper we show another (handy) proof of Gay's theorem by these algorithms. Copyright (C) 2008 John Wiley & Sons, Ltd.
An approach for speech information hiding based on the analysis by synthesis algorithm is presented. This approach can embed dynamic secret speech information data bits into original carrier speech data, with good eff...
详细信息
An approach for speech information hiding based on the analysis by synthesis algorithm is presented. This approach can embed dynamic secret speech information data bits into original carrier speech data, with good efficiency in steganography and good quality in output speech. It is superior to classical algorithms, e.g., least significant bit, which can only embed fixed 1, 2 and 4 bit data into original carrier speech individually.
Using the recently developed abs algorithm for solving linear Diophantine equations we give a representation of the solutions of a system of in linear integer inequalities in n variables, m less than or equal to n, wi...
详细信息
Using the recently developed abs algorithm for solving linear Diophantine equations we give a representation of the solutions of a system of in linear integer inequalities in n variables, m less than or equal to n, with full rank coefficient matrix. We apply this result to solve linear integer programming problems with m less than or equal to n inequalities.
In this paper, we discuss the application of the abs algorithm to the simplex method, the dual simplex method, the linear complementary problem. We consider the abs formulation of the stopping criterion, the search di...
详细信息
In this paper, we discuss the application of the abs algorithm to the simplex method, the dual simplex method, the linear complementary problem. We consider the abs formulation of the stopping criterion, the search direction, the minimal rule to determine the vectors entering and leaving the basis matrix and the updating of the Abaffian matrix after a basis vector exchange. The Lemke algorithm for the LCP problem is reformulated in terms of the abs procedure.
The implicit LU algorithm of the (basic) abs class corresponds to the parameter choices H-1= I, z(i) = w(i) = e(i). The algorithm can be considered as the abs version of the classic LU factorization algorithm. In this...
详细信息
The implicit LU algorithm of the (basic) abs class corresponds to the parameter choices H-1= I, z(i) = w(i) = e(i). The algorithm can be considered as the abs version of the classic LU factorization algorithm. In this paper we consider the generalization where the initial matrix H-1 is arbitrary except for a certain condition. We prove that every algorithm in the abs class is equivalent, in the sense of generating the same set of search directions, to a generalized implicit LU algorithm, with suitable initial matrix, that can be interpreted as a right preconditioning matrix. We discuss some consequences of this result, including a straightforward derivation of Bienayme's (1853) classical result on the equivalence of the Gram-Schmidt orthogonalization procedure with Gaussian elimination on the normal equations.
暂无评论