A new approach to discretization applied to a continuous, nonlinear, sliding-mode-like control using nonsmooth analysis

This paper introduces a new approach to discretization of nonlinearcontrol laws with a Lipschitz property. The sampling time isdefined as a parameter, which must be selected sufficientlysmall so that the closed-loop system is stable. In contrastto similar results, the stabilizing effect of the control istaken into account. This can result in less conservative constraintson the minimum sampling frequency. The discretization techniquesare explained on a general nonlinear model and applied to thediscretization of a novel nonlinear, robust sliding-mode-likecontrol law. Similar robustness features as for continuous controlare demonstrated. Nonsmooth Lyapunov functions are used forthe discretized sliding-mode-like control introducing cone shapedregions of the state space. One of these cone shaped regionscoincides with a cone shaped layer around the sliding mode definedby the continuous sliding-mode-like control. A stability theoremusing nonsmooth Lyapunov functions is provided.     

具连续时滞Liénard方程概周期解的存在唯一性

结合Liapunov泛函，研究了具连续时滞Lienard方程概周期解的存在唯一性和安全一致渐进稳定性。     

一类随机环境中的随机游动

在Solomn的模型的基础上对一类随机环境中随机游动进行了讨论，并得出了一个常返性准则和一些极限性质。     

求解课程表问题的分支定界算法

本通过对中学排课程表问题的特征分析，给出了基于分支定界法的优化算法，数值试验表明这是解决一般编排中学课程表问题的有效算法。     

Parallelization of a Two-Phase Metaheuristic for Routing Problems with Time Windows

This paper describes the parallelization of a two-phase metaheuristic for the vehicle routing problem with time windows and a central depot (VRPTW). The underlying objective function combines the minimization of the number of vehicles in the first search phase of the metaheuristic with the minimization of the total travel distance in the second search phase. The parallelization of the metaheuristic follows a type 3 parallelization strategy (cf. Crainic and Toulouse (2001). In F. Glover and G. Kochenberger (eds.). State-of-the-Art Handbook in Metaheuristics. Norwell, MA: Kluwer Academic Publishers), i.e. several concurrent searches of the solution space are carried out with a differently configured metaheuristic. The concurrently executed processes cooperate through the exchange of solutions. The parallelized two-phase metaheuristic was subjected to a comparative test on the basis of 358 problems from the literature with sizes varying from 100 to 1000 customers. The derived results seem to justify the proposed parallelization concept.     

Dynamics of Inhomogeneous Chains of Coupled Quadratic Maps

A new effective local analysis method is elaborated for coupled map dynamics. In contrast to the previously suggested methods, it allows visually investigating the evolution of synchronization and complex-behavior domains for a distributed medium described by a set of maps. The efficiency of the method is demonstrated with examples of ring and flow models of diffusively coupled quadratic maps. An analysis of a ring chain in the presence of space defects reveals some new global-behavior phenomena.     

A Characterization of Cosmological Time Functions

A characterization of time functions on a spacetime is made by using theMöbius equation. It is shown that a time function characterized in this wayyields past timelike geodesic incompleteness and local Lorentzian warpedproduct decomposition of spacetime, provided that the stress-energy tensoris a fluid. Also, by imposing additional assumptions on the stress-energytensor and global analytic structure of the spacetime, more restrictivedecompositions closer to Robertson–Walker spacetimes are obtained.     

Exact Buffer Overflow Calculations for Queues via Martingales

Let _n be the first time a queueing process like the queue length or workload exceeds a level n. For the M/M/1 queue length process, the mean _n and the Laplace transform e^-sn is derived in closed form using a martingale introduced in Kella and Whitt (1992). For workload processes and more general systems like MAP/PH/1, we use a Markov additive extension given in Asmussen and Kella (2000) to derive sets of linear equations determining the same quantities. Numerical illustrations are presented in the framework of M/M/1 and MMPP/M/1 with an application to performance evaluation of telecommunication systems with long-range dependent properties in the packet arrival process. Different approximations that are obtained from asymptotic theory are compared with exact numerical results.     

The Flooding Time in Random Graphs

Based on our analysis of the hopcount of the shortest path between two arbitrary nodes in the class G _p (N) of random graphs, the corresponding flooding time is investigated. The flooding time T _N (p) is the minimum time needed to reach all other nodes from one node. We show that, after scaling, the flooding time T _N (p) converges in distribution to the two-fold convolution ^(2*) of the Gumbel distribution function (z)=exp (–e ^–z ), when the link density p _N satisfies Np _N /(log N)³ if N .     

Fuzzy network technique for technological forecasting

The stochastic network technique is known to be a powerful tool carrying out a technological forecast of complex systems. A network dealt with is characterized by a tetrad of essential elements: logical nodes with some inputs and outputs, probabilistics activity branches, feedback loops, and multiple sources and sinks. A set of network parameters is defined for each element and their values are estimated for practical analysis of the network. In the case where the system to be treated is very large and/or complex, it cannot always be represented by a definite network and therefore forecasted values of parameters are inevitably indefinite themselves. A conventional probabilistic approach is sometimes inadequate in such a case. In the light of these facts, the paper proposes a fuzzy network technique, in which among activity branches emanating from a node, a branch to be undertaken once the node is realized belongs to a fuzzy set; and the time required to complete an activity branch belongs to a fuzzy set. Operations of maximum and minimum for sum and product of fuzzy sets take the place of manipulations of addition and multiplication for probabilities, respectively. Although the operations are somewhat formal, the obtained results seem interesting. A numerical example is attached to show a comparison of the proposed technique with the conventional one.