Some non-interior path-following methods based on a scaled central path for linear complementarity problems

In this paper we present some non-interior path-following methods for linear complementarity problems. Instead of using the standard central path we use a scaled central path. Based on this new central path, we first give a feasible non-interior path-following method for linear complementarity problems. And then we extend it to an infeasible method. After proving the boundedness of the neighborhood, we prove the convergence of our method. Another point we should present is that we prove the local quadratic convergence of feasible method without the assumption of strict complementarity at the solution.     

信用传染违约Aalen加性风险模型

本文考虑了基于加性风险模型的信用风险违约预报模型,不但考虑了宏观因素和公司个体因素,并且通过引入行业因素来刻画公司间可能存在的不同于宏观因素的信用传染效应,由此克服了以往模型对违约相关性的低估.本文在参数加性风险模型下给出极大似然估计及渐近性,提出两种估计方法并比较二者表现,得到最优权估计更加有效.同时本文还考虑了半参数的风险模型,并基于鞅的估计方程得到其估计及渐近性,均得到不错的结果.     

Curves as measured foliation on noncompact surfaces

In the present work, that regards the Thurston's theory, we prove that, if we choose a closed curve, how we wish, on a noncompact surface, it is always possible to construct a particular masured foliation that has the choosed curve like a leaf; we also prove this foliation has a remarkable property that makes very easy to mesure all homotopy classes of closed curves of our surface. To prove this statement we need some Propositions and some Lemma that we also demonstre.     

Exploring an unknown graph

We wish to explore all edges of an unknown directed, strongly connected graph. At each point, we have a map of all nodes and edges we have visited, we can recognize these nodes and edges if we see them again, and we know how many unexplored edges emanate from each node we have visited, but we cannot tell where each leads until we traverse it. We wish to minimize the ratio of the total number of edges traversed divided by the optimum number of traversals, had we known the graph. For Eulerian graphs, this ratio cannot be better than two, and two is achievable by a simple algorithm. In contrast, the ratio is unbounded when the deficiency of the graph (the number of edges that have to be added to make it Eulerian) is unbounded. Our main result is an algorithm that achieves a bounded ratio when the deficiency is bounded. © 1999 John Wiley & Sons, Inc. J Graph Theory 32: 265–297, 1999     

Optimal control of nonlinear evolution inclusions

In this paper, we study the optimal control of nonlinear evolution inclusions. First, we prove the existence of admissible trajectories and then we show that the set that they form is relatively sequentially compact and in certain cases sequentially compact in an appropriate function space. Then, with the help of a convexity hypothesis and using Cesari's approach, we solve a general Lagrange optimal control problem. After that, we drop the convexity hypothesis and pass to the relaxed system, for which we prove the existence of optimal controls, we show that it has a value equal to that of the original one, and also we prove that the original trajectories are dense in an appropriate topology to the relaxed ones. Finally, we present an example of a nonlinear parabolic optimal control that illustrates the applicability of our results.This research was supported by NSF Grant No. DMS-88-02688.     

Estimation of error variance in ANOVA model and order restricted scale parameters

We consider the estimation of error variance in the analysis of experiments using two level orthogonal arrays. We address the estimator which is the minimum of all the estimators which we obtain by pooling some sums of squares for factorial effects. Under squared error loss, we discuss whether or not this estimator uniformly improves upon the best positive multiple of error sum of squares. We show that when we have two factorial effects, we obtain uniform improvement. However, we show that when we have more than two factorial effects, we cannot necessarily obtain uniform improvement. Further, the above results are applied to the problem of estimating the smallest scale parameter of chi-square distributions.     

BL-general fuzzy automata and accept behavior

In this note, we focus on behavior of BL-general fuzzy automata (for simplicity BL-GFA) and we obtain the free realization for a given behavior, that is, a BL-general fuzzy automaton whose behavior is given behavior. Then we find the realization with the minimum number of states. The minimization takes two steps: at first discard all superfluous states, and then we merge all pairs of states which have the same behavior. Moreover we prove some theorems. In particular, we show that the minimal reduction of the reachable part of an BL-GFA is the minimal realization of the behavior it. Finally we give some examples to clarify these notions.     

Hereditary atomicity in integral domains

If every subring of an integral domain is atomic, we say that the latter is hereditarily atomic. In this paper, we study hereditarily atomic domains. First, we characterize when certain direct limits of Dedekind domains are Dedekind domains in terms of atomic overrings. Then we use this characterization to determine the fields that are hereditarily atomic. On the other hand, we investigate hereditary atomicity in the context of rings of polynomials and rings of Laurent polynomials, characterizing the fields and rings whose rings of polynomials and rings of Laurent polynomials, respectively, are hereditarily atomic. As a result, we obtain two classes of hereditarily atomic domains that cannot be embedded into any hereditarily atomic field. By contrast, we show that rings of power series are never hereditarily atomic. Finally, we make some progress on the still open question of whether every subring of a hereditarily atomic domain satisfies ACCP.     

基于跳扩散过程的可转换债券的定价

本文标的股票的方程采用跳扩散方程,首先规定一个跳跃的涨跌区间,这样就可以很快的找出跳跃点,我们根据跳跃点将股价聚类,然后把各个类看成是总体中抽取出来的一个样本,我们就可以估计出跳扩散方程中的所有参数.由于我们的标的股票的方程是含跳过程,因此无法找出完全保值的自融资策略,但我们可以根据风险最小化的原理给出可转换债券的价格,最后运用Monte Carlo模拟计算出了南京水运转债在0时刻的价格。     

Asymptotic behaviour of a closed‐loop thermosyphon with linear friction and viscoelastic binary fluid

Viscoelastic fluids represent a major challenge both from an engineering and from a mathematical point of view. Recently, we have shown that viscoelasticity induces chaos in closed‐loop thermosyphons even when we consider binary fluids, this is, when we consider a solute in the fluid, as water and antifreezes, for example. In this work, we consider a linear friction law, and we show that in this case with the addition of a solute to the fluid we can prove, under some conditions, chaotic asymptotic behavior for suitable geometry of the circuit and heat flux or ambient temperature functions.     

The value of foresight

Suppose you have one unit of stock, currently worth 1, which you must sell before time $T$. The Optional Sampling Theorem tells us that whatever stopping time we choose to sell, the expected discounted value we get when we sell will be 1. Suppose however that we are able to see $a$ units of time into the future, and base our stopping rule on that; we should be able to do better than expected value 1. But how much better can we do? And how would we exploit the additional information? The optimal solution to this problem will never be found, but in this paper we establish remarkably close bounds on the value of the problem, and we derive a fairly simple exercise rule that manages to extract most of the value of foresight.     

Nonlinear elliptic differential equations with multivalued nonlinearities

In this paper we study nonlinear elliptic boundary value problems with monotone and nonmonotone multivalued nonlinearities. First we consider the case of monotone nonlinearities. In the first result we assume that the multivalued nonlinearity is defined on all ℝ. Assuming the existence of an upper and of a lower solution, we prove the existence of a solution between them. Also for a special version of the problem, we prove the existence of extremal solutions in the order interval formed by the upper and lower solutions. Then we drop the requirement that the monotone nonlinearity is defined on all of ℝ. This case is important because it covers variational inequalities. Using the theory of operators of monotone type we show that the problem has a solution. Finally in the last part we consider an eigenvalue problem with a nonmonotone multivalued nonlinearity. Using the critical point theory for nonsmooth locally Lipschitz functionals we prove the existence of at least two nontrivial solutions (multiplicity theorem).     

Classification of quintic eutactic forms

From the classical Voronoi algorithm, we derive an algorithm to classify quadratic positive definite forms by their minimal vectors; we define some new invariants for a class, for which several conjectures are proposed. Applying the algorithm to dimension 5 we obtain the table of the 136 classes in this dimension, we enumerate the 118 eutactic quintic forms, and we verify the Ash formula.

     

Forecasting the integration of immigrants

In this research, we develop and introduce a theoretical and mathematical forecasting framework of immigrant integration using immigrant density as a single driver. First, we introduce the integration concepts we aim at forecasting. Thereafter, we introduce a theoretical and mathematical model of the relationship between integration and immigrant density. Based on this model, we develop a methodological forecasting framework. We test the framework using immigrant integration data from Spain. We produce the forecasts, and conduct the proper evaluation of them. Finally, we conclude with a brief discussion of the wider implications of our results.     

Agent-based interpretations of classic network models

The paper is aimed at developing agent-based variants of traditional network models that make full use of concurrency. First, we review some classic models of the static structure of complex networks with the objective of developing agent-based models suited for simulating a large-scale, technology-enabled social network. Secondly, we outline the basic properties that characterize such networks. Then, we briefly discuss some classic network models and the properties of the networks they generate. Finally, we discuss how such models can be converted into agent-based models (i) to be executed more easily in heavily concurrent environments and (ii) to serve as basic blocks for more complex agent-based models. We evidence that many implicit assumptions made by traditional models regarding their execution environment are too expensive or outright impossible to maintain in concurrent environments. Consequently, we present the concurrency issues resulting from the violation of such assumptions. Then, we experimentally show that, under reasonable hypothesis, the agent-based variants maintain the main features of the classic models, notwithstanding the change of environment. Eventually, we present a meta-model that we singled out from the individual classic models and that we used to simplify the agent-oriented conversion of the traditional models. Finally, we discuss the software tools that we built to run the agent-based simulations.     

Qualitative and quantitative data envelopment analysis with interval data

In this paper, we investigate DEA with interval input-output data. First we show various extensions of efficiency and that 25 of them are essential. Second we formulate the efficiency test problems as mixed integer programming problems. We prove that 14 among 25 problems can be reduced to linear programming problems and that the other 11 efficiencies can be tested by solving a finite sequence of linear programming problems. Third, in order to obtain efficiency scores, we extend SBM model to interval input-output data. Fourth, to moderate a possible positive overassessment by DEA, we introduce the inverted DEA model with interval input-output data. Using efficiency and inefficiency scores, we propose a classification of DMUs. Finally, we apply the proposed approach to Japanese Bank Data and demonstrate its advantages.     

On intermediate inquisitive and dependence logics: An algebraic study

This article provides an algebraic study of intermediate inquisitive and dependence logics. While these logics are usually investigated using team semantics, here we introduce an alternative algebraic semantics and we prove it is complete for all intermediate inquisitive and dependence logics. To this end, we define inquisitive and dependence algebras and we investigate their model-theoretic properties. We then focus on finite, core-generated, well-connected inquisitive and dependence algebras: we show they witness the validity of formulas true in inquisitive algebras, and of formulas true in well-connected dependence algebras. Finally, we obtain representation theorems for finite, core-generated, well-connected, inquisitive and dependence algebras and we prove some results connecting team and algebraic semantics.     

A conjecture on bipartite graphical regular representations

In this paper we are concerned with the classification of the finite groups admitting a bipartite DRR and a bipartite GRR.First, we find a natural obstruction that prevents a finite group from admitting a bipartite GRR. Then we give a complete classification of the finite groups satisfying this natural obstruction and hence not admitting a bipartite GRR. Based on these results and on some extensive computer computations, we state a conjecture aiming to give a complete classification of the finite groups admitting a bipartite GRR.Next, we prove the existence of bipartite DRRs for most of the finite groups not admitting a bipartite GRR found in this paper. Actually, we prove a much stronger result: we give an asymptotic enumeration of the bipartite DRRs over these groups. Again, based on these results and on some extensive computer computations, we state a conjecture aiming to give a complete classification of the finite groups admitting a bipartite DRR.     

An exact penalty global optimization approach for mixed-integer programming problems

In this work, we propose a global optimization approach for mixed-integer programming problems. To this aim, we preliminarily define an exact penalty algorithm model for globally solving general problems and we show its convergence properties. Then, we describe a particular version of the algorithm that solves mixed-integer problems and we report computational results on some MINLP problems.     

基于卫星观测数据的预测模型及其应用

在战争中为了避开敌方军事卫星的侦查,需要对其过顶时间进行预警.对于参数公开的卫星,可以通过根数来进行准确的预报.而对于参数未知的卫星,提出了一种根据过往观测数据来对卫星过顶时间进行预测的思路:将卫星与地球之间复杂的三维耦合运动进行降维,并且以地面为参考系,发现卫星星下点运动轨迹具有高度的周期性·根据这种思路,可以通过获取的过往观测数据来对卫星未来的过顶时间进行准确预测.而对于战时地面运动单位躲避卫星的问题,可以根据所面对的不同侦查卫星通过设置一个固定的路线,让地面单位在该路线中有计划的行驶,能够躲避多种卫星的侦查.