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.     

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.     

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.     

MTL代数的特征定理

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

Three types of matrix stability

Three types of stability of real matrices are compared and necessary conditions are obtained in terms of the principal submatrices. For normal matrices and matrices whose off-diagonal elements are all positive, these conditions are sufficient, and the three types of stability are all equivalent. Necessary and sufficient conditions in terms of the elements of the matrix are proven for matrices of order 2 and 3.     

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.     

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.     

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.     

Parabolic flow over a flat plate with wave disturbance in the main stream

In this paper the effects of unsteady flow past a flat plate, which is at rest, are studied when the steady parabolic flow outside the boundary layer is in a wave disturbance. Solutions are developed for large and small times. The behaviour of the amplitudes and phase leads of skin friction components along chordwise and spanwise directions are studied in detail. Two cases, one when the main stream lines are straight and yawed, and the other when the main stream lines are parabolic and concave with respect to the points on the chordwise direction are studied separately and the results are interpreted graphically.     

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.     

Morse decompositions of nonautonomous dynamical systems

The global asymptotic behavior of dynamical systems on compact metric spaces can be described via Morse decompositions. Their components, the so-called Morse sets, are obtained as intersections of attractors and repellers of the system. In this paper, new notions of attractor and repeller for nonautonomous dynamical systems are introduced which are designed to establish nonautonomous generalizations of the Morse decomposition. The dynamical properties of these decompositions are discussed, and nonautonomous Lyapunov functions which are constant on the Morse sets are constructed explicitly. Moreover, Morse decompositions of one-dimensional and linear systems are studied.

     

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

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

Some properties of complex matrix-variate generalized Dirichlet integrals

Dirichlet integrals and the associated Dirichlet statistical densities are widely used in various areas. Generalizations of Dirichlet integrals and Dirichlet models to matrix-variate cases, when the matrices are real symmetric positive definite or hermitian positive definite, are available [4]. Real scalar variables case of the Dirichlet models are generalized in various directions. One such generalization of the type-2 or inverted Dirichlet is looked into in this article. Matrix-variate analogue, when the matrices are hermitian positive definite, are worked out along with some properties which are mathematically and statistically interesting.     

Scheduling jobs with different,job-dependent earliness and tardiness penalties using the SLK method

The single machine job scheduling problem, where due dates are assigned using the SLK due date determination method, is examined assuming different penalties for the early and tardy jobs. These penalties are assumed to be job-dependent, proportional to the processing times of jobs raised to an integer, non-negative power. The objective function is the total weighted lateness. Several cases are examined and four algorithms providing the optimal sequences for these cases are presented. Examples are given and conclusions are drawn.     

Changing Assessment Practices in Science and Mathematics

One recommendation of the national reform movements in mathematics and science is to change the way students are assessed. In this article five formats of alternative assessment forms are described, and suggestions are given on how these methods can be implemented within science and mathematics classrooms. Benefits of each type of assessment are discussed and potential pitfalls are elucidated. Samples of the five formats, journal writing, open-ended problems, portfolios, interviews and performance assessments, are included.     

Semi-analytic integration of hypersingular Galerkin BIEs for three-dimensional potential problems

An accurate and efficient semi-analytic integration technique is developed for three-dimensional hypersingular boundary integral equations of potential theory. Investigated in the context of a Galerkin approach, surface integrals are defined as limits to the boundary and linear surface elements are employed to approximate the geometry and field variables on the boundary. In the inner integration procedure, all singular and non-singular integrals over a triangular boundary element are expressed exactly as analytic formulae over the edges of the integration triangle. In the outer integration scheme, closed-form expressions are obtained for the coincident case, wherein the divergent terms are identified explicitly and are shown to cancel with corresponding terms from the edge-adjacent case. The remaining surface integrals, containing only weak singularities, are carried out successfully by use of standard numerical cubatures. Sample problems are included to illustrate the performance and validity of the proposed algorithm.     

Capacitated location allocation problem with stochastic location and fuzzy demand: A hybrid algorithm

In this article, a capacitated location allocation problem is considered in which the demands and the locations of the customers are uncertain. The demands are assumed fuzzy, the locations follow a normal probability distribution, and the distances between the locations and the customers are taken Euclidean and squared Euclidean. The fuzzy expected cost programming, the fuzzy β-cost minimization model, and the credibility maximization model are three types of fuzzy programming that are developed to model the problem. Moreover, two closed-form Euclidean and squared Euclidean expressions are used to evaluate the expected distance between customers and facilities. In order to solve the problem at hand, a hybrid intelligent algorithm is applied in which the simplex algorithm, fuzzy simulation, and a modified genetic algorithm are integrated. Finally, in order to illustrate the efficiency of the proposed hybrid algorithm, some numerical examples are presented.     

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.