A new linogram algorithm for computerized tomography

We propose a new linogram algorithm for the high quality Fourierreconstruction of digital N x N images from their Radon transform.The algorithm is based on univariate fast Fourier transformsfor nonequispaced data in the time domain and in the frequencydomain. The algorithm requires only O(N² logN) arithmetic operationsand preserves the good reconstruction quality of the filteredbackprojection.     

A new method for ranking intuitionistic fuzzy values and its application in multi-attribute decision making

In this paper, we propose a new method for ranking intuitionistic fuzzy values (IFVs) by using the similarity measure and the accuracy degree of IFVs. Then we apply the proposed ranking method to multi-attribute decision making.     

A new extended Riccati equation rational expansion method and its application

In this paper, a new extended Riccati equation rational expansion method is suggested to constructing multiple exact solutions for nonlinear evolution equations. The validity and reliability of the method is tested by its application to the dispersive long wave system and the Broer–Kaup–Kupershmidt system. The method can be applied to other nonlinear evolution equations in mathematical physics.     

A new stepsize rule in He and Zhou's alternating direction method

In this paper, we propose a new stepsize rule in He and Zhou's alternating direction method. Under this new stepsize strategy, we extend their method for solving convex quadratic minimization problems to also monotone linear variational inequality problems.     

A new method for ranking fuzzy numbers and its application to group decision making

In this paper, a new method for comparing fuzzy numbers based on a fuzzy probabilistic preference relation is introduced. The ranking order of fuzzy numbers with the weighted confidence level is derived from the pairwise comparison matrix based on 0.5-transitivity of the fuzzy probabilistic preference relation. The main difference between the proposed method and existing ones is that the comparison result between two fuzzy numbers is expressed as a fuzzy set instead of a crisp one. As such, the ranking order of n fuzzy numbers provides more information on the uncertainty level of the comparison. Illustrated by comparative examples, the proposed method overcomes certain unreasonable (due to the violation of the inequality properties) and indiscriminative problems exhibited by some existing methods. More importantly, the proposed method is able to provide decision makers with the probability of making errors when a crisp ranking order is obtained. The proposed method is also able to provide a probability-based explanation for conflicts among the comparison results provided by some existing methods using a proper ranking order, which ensures that ties of alternatives can be broken.     

A stopping rule for the Robbins-Monro method

A stopping rule for the multidimensional Robbins-Monro stochastic approximation method is developed in this paper. Both moving average and stationary -mixing type of correlated noise processes are treated. Sequentially determined confidence ellipsoids are constructed to fulfill the goal for the determination of the stopping rule. The limit behavior of the algorithm is investigated. It is shown that the stopped Robbins-Monro process is asymptotically normal. Such asymptotic normality is established by means of weak convergence methods.Communicated by Y. C. Ho     

A new trigonometric method of summation and its application to the degree of approximation

The object of the present investigation is to introduce a new trigonometric method of summation which is both regular and Fourier effective and determine its status with reference to other methods of summation (see §2-§4) and also give an application of this method to determine the degree of approximation in a new Banach space of functions conceived as a generalized Holder metric (see §5).     

A Newton-like method and its application

In this paper we prove an existence and uniqueness theorem for solving the operator equation F(x)+G(x)=0, where F is a Gateaux differentiable continuous operator while the operator G satisfies a Lipschitz-condition on an open convex subset of a Banach space. As corollaries, a theorem of Tapia on a weak Newton's method and the classical convergence theorem for modified Newton-iterates are deduced. An existence theorem for a generalized Euler-Lagrange equation in the setting of Sobolev space is obtained as a consequence of the main theorem. We also obtain a class of Gateaux differentiable operators which are nowhere Frechet differentiable. Illustrative examples are also provided.     

风险调整收益及其在投资决策中的应用--对均值-方差决策准则一点补充

指出传统的均值一方差决策规则在度量风险方面的不足，认为风险与投资收益的偏差有关；指出了一种新的风险度量指标——风险组合偏差，同时提出了一种能够根据风险大小进行投资的决策指标——风险调整收益，并举例说明了二者在分析投资项目时的应用。     

A new improved Adomian decomposition method and its application to fractional differential equations

In this paper, a new improved Adomian decomposition method is proposed, which introduces a convergence-control parameter into the standard Adomian decomposition method and establishes a new iterative formula. The examples prove that the presented method is reliable, efficient, easy to implement from a computational viewpoint and can be employed to derive successfully analytical approximate solutions of fractional differential equations.     

A new rule for source connection problems

In this paper we study situations where a group of agents require a service that can only be provided from a source, the so-called source connection problems. These problems contain the standard fixed tree, the classical minimum spanning tree and some other related problems such as the k-hop, the degree constrained and the generalized minimum spanning tree problems among others. Our goal is to divide the cost of a network among the agents. To this end, we introduce a rule which will be referred to as a painting rule because it can be interpreted by means of a story about painting. Some meaningful properties in this context and a characterization of the rule are provided.     

A new rule for computing Clebsch-Gordan series

A new combinatorial rule for computing the Clebsch-Gordan series of a tensor product of irreducible SU(n)-representations is introduced. This rule provides an efficient algorithm for computing features of the Clebsch-Gordan multiplicities, such as the “characteristic nullspaces” of tensor operators, that are not easily computed by other methods. Furthermore, unlike the Littlewood-Richardson rule, this new rule generalizes, in principle, to other semisimple Lie groups. This generalization and its consequences for tensor operators are discussed in some detail. As an application, it is shown that as n increases, it is possible to find characteristic nullspaces for SU(n)-tensor operators, which have arbitrarily large multiplicity.     

An extrapolation method with step size control for nonlinear Volterra integral equations

Summary In [6] it has been shown that the midpoint rule applied to second kind volterra integral equations possesses an asymptotic expansion in even powers of the stepsizeh. In this paper we describe an extrapolation method based on the midpoint rule, together with a mechanism of step size control.     

A decomposition method for convex minimization problems and its application

1. IntroductionConsider the following special convex programming problem(P) adn{f(~) g(z); Ax = z},where f: Re - (--co, co] and g: Re - (--co, co] are closed proper convex functions andA is an m x n matrix. The Lagrangian for problem (P) is defined by L: Rad x Re x Re -- (~co, co] as follows:L(x, z, y) = f(x) g(z) (y, Ax ~ z), (1.1)where (., .) denotes the inner product in the general sense and 'y is the Lagrangian multiplierassociated with the constraint Ax = z. The augmented L…     

A new matrix method based on rigid elements and its application to plane problems

A new matrix is proposed here which is based on rigid elements. The efficiency and usefulness of this method has been demonstrated for plane problems. The purpose of this paper is to formulate the method and to indicate its validity.     

New self-adaptive step size algorithms for solving split variational inclusion problems and its applications

Numerical Algorithms - In this paper, we study a special instance of the split inverse problem (SIP), which is the split variational inclusion problem (SVIP). Three simple iterative methods for...     

A new exchange property for matroids and its application to max-min-problems

We provide a new characterization for matroids which is useful for sensitivity analysis and for solving certain max min matroid optimization problems.

---

Zusammenfassung Es wird eine neue Charakterisierung von Matroiden angegeben, welche für eine Sensitivitätsanalyse und für eine Lösung von Max-Min-Optimierungsproblemen für Matroide nützlich ist.

---

---

Research was partially supported by National Science and Engineering Research Council of Canada Grant A4181.