Depth notions for orthogonal regression

Global depth, tangent depth and simplicial depths for classical and orthogonal regression are compared in examples, and properties that are useful for calculations are derived. The robustness of the maximum simplicial depth estimates is shown in examples. Algorithms for the calculation of depths for orthogonal regression are proposed, and tests for multiple regression are transferred to orthogonal regression. These tests are distribution free in the case of bivariate observations. For a particular test problem, the powers of tests that are based on simplicial depth and tangent depth are compared by simulations.     

Periodic and solitary-wave solutions of the Degasperis–Procesi equation

Travelling-wave solutions of the Degasperis–Procesi equation are investigated. The solutions are characterized by two parameters. For propagation in the positive x-direction, hump-like, inverted loop-like and coshoidal periodic-wave solutions are found; hump-like, inverted loop-like and peakon solitary-wave solutions are obtained as well. For propagation in the negative x-direction, there are solutions which are just the mirror image in the x-axis of the aforementioned solutions. A transformed version of the Degasperis–Procesi equation, which is a generalization of the Vakhnenko equation, is also considered. For propagation in the positive x-direction, hump-like, loop-like, inverted loop-like, bell-like and coshoidal periodic-wave solutions are found; loop-like, inverted loop-like and kink-like solitary-wave solutions are obtained as well. For propagation in the negative x-direction, well-like and inverted coshoidal periodic-wave solutions are found; well-like and inverted peakon solitary-wave solutions are obtained as well. In an appropriate limit, the previously known solutions of the Vakhnenko equation are recovered.     

State models and asymptotic behaviour of 2D positive systems

Homogeneous 2D positive systems are 2D state-space models whosevariables are alwalys nonnegative and, consequently, are describedby a pair of nonnegative square matrices (A, B). In the paper,the properties of these pairs are discussed both in the generalcase and under particular assumptions like finite memory, separability,and property L. Various aspects of the positive asymptotic dynamic are considered;in particular, sufficient conditions are provided guaranteeingthat the local states are eventually strictly positive. Finally,some results on the convergence of the states towards a constantasymptotic distribution are presented.     

Stability of random impulsive coupled systems on networks with Markovian switching

Abstract

This article is intended to study global asymptotical stability in probability for random impulsive coupled systems on networks with Markovian switching. Two cases are considered. (1) Continuous dynamics are stable while impulses are unstable; (2) impulses are stable while continuous dynamics are unstable. To begin with, based on Lyapunov method as well as graph-theoretic technique, several new stability criteria in two cases are derived, that are, the Lyapunov-type criteria and the coefficients-type criteria. Then main results are used for a class of random impulsive coupled oscillators. Finally, the effectiveness of the obtained results is verified by numerical simulations.     

MTL代数的特征定理

对于逻辑系统代数结构的研究,是一个十分重要的研究课题.近期提出的BL代数,R_0代数,MTL代数就是这个方向具有代表性的研究成果.本文讨论MTL代数的性质与结构,给出这种代数的几个特征定理,澄清这种代数与其它代数结构的关系.鉴于单位区间中由左连续t-范数诱导的剩余蕴涵与MTL代数的紧密联系,本文还考察了这种模糊蕴涵的特征性质.     

近程空中目标航路研究

本文在等加速俯冲飞行假定下，分析了近程空中目标航路的特点，并据此提出了目标航路模型．经过投影变换，把目标航路模型转化为二次函数，从而使目标航路的滤波及预报问题得到简化．采用递推最小二乘（ＲＬＳ）原理，给出了目标航路的在线滤波器及预报器．最后，对本文方法进行了仿真，并对仿真结果进行了分析．     

由格蕴涵代数诱导的伴随半群

给出由格蕴涵代数诱导出的伴随半群及有关概念 ,详细讨论伴随半群中的元素即格蕴涵代数的左映射的性质 ,得到它们的几个等价条件。最后讨论由格蕴涵代数诱导的两个双格半群与伴随半群之间的关系 ,并证明这些半群是幂等的当且仅当它们是由格 H蕴涵代数所诱导     

秩为1矩阵的性质及应用

给出了秩1矩阵的结构,讨论了这类矩阵在矩阵运算、对角化、标准型等方面的性质,推广和改进了文[1]的一些相关结果,并指出了它的若干应用,重点讨论了一类矩阵,得到了有关结论和方法.     

Algorithms for finding optimum trees: Description,use and evaluation

This work is devoted to the problem of finding an optimum spanning tree in an undirected graph. Both min-sum and min-max trees are sought. The five algorithms considered are among the most well-known proposed in the literature. They are described in sect. 1 as thoroughly as possible, using a simplified Pascal language; all min-sum algorithms are derived from a unique prototype formulation. In sect. 2, the algorithms are implemented in PFORT to enhance their portability and ad hoc data structures are utilized in order to obtain subroutines as efficient as possible. Finally, in sect. 3, the programs are evaluated, comparing their performances in handling several classes of randomly generated graphs. Various observations are reported, and some indications for choosing the most suitable algorithm in each case are provided.Sponsored by the CNR finalized project on Informatics (subproject P1, task SOFMAT), Italy.     

On Time Discretizations for Spectral Methods

New methods are introduced for the time integration of the Fourier and Chebyshev methods of solution for dynamic differential equations. These methods are unconditionally stable, even though no matrix inversions are required. Time steps are chosen by accuracy requirements alone. For the Fourier method both leapfrog and Runge-Kutta methods are considered. For the Chebyshev method only Runge-Kutta schemes are tested. Numerical calculations are presented to verify the analytic results. Applications to the shallow water equations are presented.     

Conflict resolution in fuzzy environment

Conflict resolution methodology is discussed with fuzzified Pareto frontier. Four solution concepts, namely, the Nash solution, the generalized Nash solution, the Kalai-Smorodinsky concept, and a solution method based on a special bargaining process are examined. The solutions are also fuzzy, the corresponding payoff values are fuzzy numbers, the membership functions of which are determined. Three particular cases are considered in the paper. Linear, quadratic, and general nonlinear Pareto frontiers with known shape are examined.     

Some properties of singular integral operators over an open curve Dedicated to the 85th birthday of Prof. Lu Jianke

In this paper, the stability properties, the endpoint behavior and the invertible relations of Cauchy-type singular integral operators over an open curve are discussed. If the endpoints of the curve are not special, this type of operators are proved to be stable. At the endpoints, either the singularity or smoothness of the operators are exactly described. And the function sets or spaces on which the operators are invertible as well as the corresponding inverted operators are given. Meanwhile, some applications for the solution of Cauchy-type singular integral equations are illustrated.     

Some properties of singular integral operators over an open curve Dedicated to the 85th birthday of Prof.Lu Jinake

In this paper, the stability properties, the endpoint behavior and the invertible relations of Cauchy-type singular integral operators over an open curve are discussed. If the endpoints of the curve are not special, this type of operators are proved to be stable. At the endpoints, either the singularity or smoothness of the operators are exactly described. And the function sets or spaces on which the operators are invertible as well as the corresponding inverted operators are given. Meanwhile, some applications for the solution of Cauchy-type singular integral equations are illustrated.     

Economic design of screening procedures when the rejected items are reprocessed

In a screening inspection, all of the items are subject to acceptance inspection. If an item fails to meet the predetermined specifications, it is rejected. In this paper, economic screening procedures are considered when the rejected items are reprocessed. It is assumed that the reprocessed and nonreprocessed items are produced by the same manufacturing process and therefore their quality characteristics are identically and independently distributed. Screening procedures based on the performance variable of interest and a variable which is correlated with the performance variable are considered. Cost models are constructed which involve the cost incurred by imperfect quality, reprocessing cost, and inspection cost. Methods of finding the optimal screening procedures are presented and an example is given.     

QFS-Domains and their Lawson Compactness

In this paper, concepts of quasi-finitely separating maps and quasi-approximate identities are introduced. Based on these concepts, QFS-domains and quasicontinuous maps are defined. Properties and characterizations of QFS-domains are explored. Main results are: (1) finite products, nonempty Scott closed subsets and quasicontinuous projection images of QFS-domains, as well as FS-domains, are all QFS-domains; (2) QFS-domains are compact in the Lawson topology; (3) An L-domain is a QFS-domain iff it is an FS-domain, iff it is compact in the Lawson topology; (4) Bounded complete quasicontinuous domains, in particular quasicontinuous lattices, are all QFS-domains.     

近程空中目标航路研究

本文在等加速俯冲飞行假定下,分析了近程空中目标航路的特点,并据此提出了目标航路模型.经过投影变换,把目标航路模型转化为二次函数,从而使目标航路的滤波及预报问题得到简化,采用弟推最小二乘(RLS)原理,给出了目标航路的滤波器及预报器,最后,对本文方法进行了仿真,并对仿真结果进行了分析.     

Planes and processes

This article presented to Combinatorics 2006 is a survey of finite projective planes and the processes used to construct them. All non-translation planes are described, fundamental processes in translation planes are defined and some of these are used to connect semi-field flocks with symplectic spreads. Hermitian ovoids are connected to extensions of derivable nets, and three types of ‘lifting’ methods are discussed. Furthermore, hyperbolic fibrations and ‘regulus-inducing’ central collineation groups are connected to flocks of quadratic cones. Finally, hyper-reguli and multiple hyper-regulus replacement are considered.     

Enumeration of point-determining graphs

Point-determining graphs are graphs in which no two vertices have the same neighborhoods, co-point-determining graphs are those whose complements are point-determining, and bi-point-determining graphs are those both point-determining and co-point-determining. Bicolored point-determining graphs are point-determining graphs whose vertices are properly colored with white and black. We use the combinatorial theory of species to enumerate these graphs as well as the connected cases.     

On the boundedness and unboundedness of external polyhedral estimates for reachable sets of linear differential systems

The boundedness and unboundedness properties of external polyhedral (paralle-lepiped-valued) estimates are investigated for reachable sets of linear differential systems with a stable matrix. Boundedness and unboundedness criteria on an infinite time interval are presented for two types of estimates (“touching” estimates, which were introduced earlier, and estimates with constant orientation matrix). Conditions for the system matrix and bounding sets are given under which there are bounded estimates among the estimates of the mentioned types, under which there are unbounded estimates, and under which all the estimates are bounded or all the estimates are unbounded. In terms of the exponents of the estimates, the possible rate of their growth is described. For two-dimensional systems, the classification and comparison of possible situations of the boundedness or unboundedness for estimates of both types are given and boundedness criteria for estimates with special (orthogonal and “quasi-orthogonal”) constant orientation matrices are found. Results of numerical modeling are presented.