Alternative Method Of Finding Research Articles

New Approach to Obtain the Maximum Flow in a Network and Optimal Solution for the Transportation Problems

The maximum flow problem is also one of the highly regarded problems in the field of optimization theory in which the objective is to find a feasible flow through a flow network that obtains the maximum possible flow rate from source to sink. The literature demonstrates that different techniques have been developed in the past to handle the maximum amount of flow that the network can handle. The Ford-Fulkerson algorithm and Dinic's Algorithm are the two major algorithms for solving these types of problems. Also, the Max-Flow Min-Cut Theorem, the Scaling Algorithm, and the Push–relabel maximum flow algorithm are the most acceptable methods for finding the maximum flows in a flow network. In this novel approach, the paper develops an alternative method of finding the maximum flow between the source and target nodes of a network based on the "max-flow." Also, a new algorithmic approach to solving the transportation problem (minimizing the transportation cost) is based upon the new maximum flow algorithm. It is also to be noticed that this method requires a minimum number of iterations to achieve optimality. This study's algorithmic approach is less complicated than the well-known meta-heuristic algorithms in the literature. 

An alternate method for finding more for less solution to fuzzy transportation problem with mixed constraints

In this paper, we present a different process for the optimal solution to mixed constraints transportation problem with imprecise coefficients without changing to its crisp equivalent form which is very distinct from other existing methods. Here, all the variables are considered to be triangular fuzzy numbers. Utilizing a parametric form of triangular fuzzy numbers such as left fuzziness index, right fuzziness index, modal value and by using proposed algorithm, we obtained the initial basic fuzzy feasible solution to the problem without changing to its crisp equivalent form. To obtain the solution, we use fuzzy ranking dependent on left and right spreads at some S-level of fuzzy numbers and fuzzy arithmetic dependent on both location index function and fuzziness index function. We further discuss the more for less solution by obtaining shadow prices to the problem. The more for less situation occurs when we raise the supplies, and demand quantities may cause to reduce the optimal transportation cost. The more for less paradox is very useful to a manager in dynamic, for example expanding an item house loading level or plant age breaking point and publicizing attempts to build request at explicit markets. A numerical example is solved to show the adequacy of the proposed algorithm.

Arithmetic operations of trapezoidal fuzzy variable using credibility theory

In this paper, we have developed an alternative method of finding the fuzzy membership function which leads the functions of trapezoidal fuzzy variables. Here we have used the concept of credibility theory to find out an alternative method of computing different type arithmetic operations of trapezoidal fuzzy variables. This method also lead us to find the membership function for the nth root of a trapezoidal fuzzy variable. The method has been illustrated with the help of some numerical examples.

A computing capability test for a switched system control design using the Haris-Rogers method

The problem of finding stabilizing controllers for switched systems is an area of much research interest as conventional concepts from continuous time and discrete event dynamics do not hold true for these systems. Many solutions have been proposed, most of which are based on finding the existence of a common Lyapunov function (CLF) or a multiple Lyapunov function (MLF) where the key is to formulate the problem into a set of linear matrix inequalities (LMIs). An alternative method for finding the existence of a CLF by solving two sets of linear inequalities (LIs) has previously been presented. This method is seen to be less computationally taxing compared to methods based on solving LMIs. To substantiate this, the computational ability of three numerical computational solvers, LMI solver, cvx, and Yalmip, as well as the symbolic computational program Maple were tested. A specific switched system comprising four second-order subsystems was used as a test case. From the obtained solutions, the validity of the controllers and the corresponding CLF was verified. It was found that all tested solvers were able to correctly solve the LIs. The issue of rounding-off error in numerical computation based software is discussed in detail. The test revealed that the guarantee of stability became uncertain when the rounding off was at a different decimal precision. The use of different external solvers led to the same conclusion in terms of the stability of switched systems. As a result, a shift from using a conventional numerical computation based program to using computer algebra is suggested.

Finding communities in linear time by developing the seeds

We present an alternate method for finding the communities in a complex network. We introduce two concepts named the seed of the community and the absorption power of the seed in complex networks. First, we find the seeds and then develop them by considering their absorption power to achieve the communities. We compare the modularity and the computational complexity of this algorithm with some other existing methods, and we show that this algorithm is very fast and efficient in comparison with some recently fast algorithms.

The kth default time distribution and basket default swap pricing

We propose an alternative method for finding the kth default time distribution in a homogeneous portfolio with dependency. Analysing order statistics of default times with a one-factor Gaussian copula model, we explicitly derive the probability distribution. Moreover, we compute the prices of basket default swaps such as the kth to default swaps and m out of n default swaps within our framework. To test the efficiency and accuracy of our method we compare the theoretical prediction with existing methods.

New Demerit Control Limits for Poisson Distributed Defects

More than one type of defect may be found in complex products, and these defects are not always of equal severity. They can be categorized according to the degree to which they affect product quality, commonly measured as a weighted sum of each category's defects and considered an observation of demerits. The number of demerits is monitored using a demerit control chart. Traditionally, this chart is constructed with parameters based on the normal distribution, and 3-sigma limits are established. These control limits have been improved upon by other authors' use of the characteristic function of demerits to determine the actual probability distribution of the statistic and establish probability-based limits. In the present work, we present an alternative method for finding the exact distribution of demerits which gives results different from those previously produced with the characteristic function.

Exactly Solvable Quantum Mechanical Potentials: An Alternative Approach

An alternative method for finding exactly solvable quantum mechanical potentials is presented and discussed. As examples of this approach, the hydrogenic (Coulomb) radial potential and the anharmonic Pöschl—Teller diatomic potential are derived. The utility of the latter potential is checked by fitting it to published data for the B electronic state of diatomic iodine. This alternative means of finding exactly solvable quantum mechanical potentials should be of interest and use to physical and theoretical chemists.

Transforming Variables Using the Dirac Generalized Function

This article provides an alternative method of finding the distribution of a function of one or more random variables using the Dirac generalized function. Unlike the conventional change-of-variable technique which involves a one-to-one transformation and computation of the Jacobian, here the procedure for obtaining the distributions of functions of random variables is shown to be simple, direct, and powerful.

Minimum Qof small Antennas

A detailed analysis is presented which shows that the method introduced by Collin and Rothschild in 1964 for finding the time averaged stored energy in the electromagnetic field surrounding a small antenna is valid and leads to correct evaluation of the minimum Q of a small antenna. An alternative method for finding the minimum Q of small antennas is also presented. This method is based on the natural complex resonant frequency of a TE or TM mode tuned to resonance by a reactive surface impedance on the minimum circumscribing sphere that encloses the antenna. This alternative method of finding the minimum Q of a small antenna is shown to give results in close agreement with the earlier results. The paper also provides a critique of recent work by D. M. Grimes and C. A. Grimes in which they claim that smaller antenna Q's can be obtained than that found by earlier investigators. It is shown that the results obtained by Grimes and Grimes are based on incorrect hypothesis and are wrong.

The whiplash problem: an application of vector spherical harmonics

A brief discussion of an alternate method for finding the displacements of an elastic, homogeneous, isotropic sphere under a rotational loading is given. The method is shown to be applicable to nonconservative loadings and asymmetric geometry. Expressions for the strains and stresses are also given.

On Optimal-Pivoting Algorithms in Sparse Matrices

This correspondence presents an alternate method for finding the minimum fill-in during each step of elimination for both the GaussJordan elimination and the Gaussian elimination. The correspondence also describes an improvement in sparsity in computer-aided large-network analysis by obtaining the optimal pivot at each step of elimination on sparse matrices. This proposed optimal-pivot ordering appears to lead to an overall minimum for computer storage and arithmetic operation count.

Neutron Spectroscopic Factors from Isobaric Analog States

The spectroscopic factors ${S}_{n}$ of bound neutron states are usually found from ($d,p$) stripping reactions. An alternative method of finding ${S}_{n}$ for medium-to-heavy nuclei is to analyze isobaric analog resonances observed in ($p,p$) scattering from these nuclei. The present analysis uses a modified $R$-matrix theory in which boundary matching is done within the optical-model potential region rather than directly onto the Coulomb potential region. A resonance mixing phase and an optical penetrability are introduced. Both single- and multilevel resonances are treated. The effects of compound elastic scattering and the energy dependence of the level shift are investigated. Formulas for the spreading width are obtained. The variation of ${S}_{n}$ with the value of the matching radius and the best choice of this radius are discussed. As examples of the method, analyses of the $s$-wave resonance in $^{92}\mathrm{Zr}(p,p)^{92}\mathrm{Zr}$ near 6.0-MeV bombarding energy and of $s$- and $d$-wave resonances in $^{90}\mathrm{Zr}(p,p)^{90}\mathrm{Zr}$ near 5.8 and 6.8 MeV are presented. The values of ${S}_{n}$ obtained are compared with those from ($d,p$) experiments, and the reliability of the two methods is discussed.