In this paper, we first reduce the problem of finding a minimum parity (g,f)-factor of a graph G into the problem of finding a minimum perfect matching in a weighted simple graph G*. Using the structure of G*, a necessary and sufficient condition for the existence of an even factor is derived.
This paper was accomplished while the second author was visiting the Center for Combinatorics, Nankai University.
The research is supported by NSFC 相似文献
A Bayesian approach is used to analyze the seismic events with magnitudes at least 4.7 on Taiwan. Following the idea proposed
by Ogata (1988,Journal of the American Statistical Association,83, 9–27), an epidemic model for the process of occurrence times given the observed magnitude values is considered, incorporated
with gamma prior distributions for the parameters in the model, while the hyper-parameters of the prior are essentially determined
by the seismic data in an earlier period. Bayesian inference is made on the conditional intensity function via Markov chain
Monte Carlo method. The results yield acceptable accuracies in predicting large earthquake events within short time periods. 相似文献
A method is developed for a stress analysis in an infinite elastic body containing two neighboring periodically cophasaly curved fibers located along two parallel lines. The stress distribution is studied when the body is loaded at infinity by uniformly distributed normal forces in the fiber direction. The investigation is carried out within the framework of a piecewise homogeneous body model with the use of exact three-dimensional equations of elasticity theory. Numerical results related to the stress distribution considered and the influence of interaction between the fibers on this distribution are given. 相似文献
In this paper, by means of a new twin fixed-point theorem in a cone, the existence of at least two positive solutions of m-point boundary value problem for second order dynamic equations on time scales is considered. 相似文献
A model for parallel and distributed programs, the dynamic process graph (DPG), is investigated under graph-theoretic and complexity aspects. Such graphs embed constructors for parallel programs, synchronization mechanisms as well as conditional branches. They are capable of representing all possible executions of a parallel or distributed program in a very compact way. The size of this representation can be as small as logarithmic with respect to the size of any execution of the program.
In a preceding paper [A. Jakoby, et al., Scheduling dynamic graphs, in: Proc. 16th Symposium on Theoretical Aspects in Computer Science STACS'99, LNCS, vol. 1563, Springer, 1999, pp. 383–392] we have analysed the expressive power of the general model and various variants of it. We have considered the scheduling problem for DPGs given enough parallelism taking into account communication delays between processors when exchanging data. Given a DPG the question arises whether it can be executed (that means whether the corresponding parallel program has been specified correctly), and what is its minimum schedule length.
In this paper we study a subclass of dynamic process graphs called
-output DPGs, which are appropriate in many situations, and investigate their expressive power. In a previous paper we have shown that the problem to determine the minimum schedule length is still intractable for this subclass, namely this problem is
-complete as is the general case. Here we will investigate structural properties of the executions of such graphs. A natural graph-theoretic conjecture that executions must always split into components that are isomorphic to subgraphs turns out to be wrong. We are able to prove a weaker property. This implies a quadratic upper bound on the schedule length that may be necessary in the worst case, in contrast to the general case, where the optimal schedule length may be exponential with respect to the size of the representing DPG. Making this bound constructive, we obtain an approximation to a
-complete problem. Computing such a schedule and then executing the program can be done on a parallel machine in polynomial time in a highly distributive fashion. 相似文献
A detailed study of the generalized M2 factor of hard-edged diffracted beams based on the truncated second-order moments method, asymptotic analysis and self-convergent beam width approach is performed. The dependence of the generalized M2 factor on the parameters characterizing the spatial profile, and beam truncation, etc. is analyzed. 相似文献
A simple and accurate algorithm (phase scanning method) is proposed for 3D surface contouring and dynamic response determination of a vibrating object. A sinusoidal fringe pattern is projected onto a low-frequency vibrating object by a programmable liquid crystal display projector. The fringe patterns are captured by a high-speed CCD camera with a telecentric gauging lens. Phase values are evaluated point by point using phase scanning method. From the phase values of each point on the object, the contour of the specimen at different instants of vibration can be retrieved. In this paper, a small vibrating coin is used to demonstrate the validity of the method and the experimental results are compared with test results on a stationary coin using four-step phase shifting and fast Fourier transform methods. The technique is especially useful in applications where the vibrating object has a complicated shape. 相似文献